Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Didier Lime"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably, the parametric reachability emp
Externí odkaz:
https://doaj.org/article/43f1e7cde3144f0191cb76c17e779036
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 2 (2021)
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters. We focus here on the EF-emptiness problem: "is the set of parameter v
Externí odkaz:
https://doaj.org/article/205d01d37ae54ff6bacf5d3e97a6a1e2
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)
Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valu
Externí odkaz:
https://doaj.org/article/1433fd30f392498c95e6456a5a3d73c8
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783031336195
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a9e5809a9bca92501bbf6437e46e9c8
https://doi.org/10.1007/978-3-031-33620-1_21
https://doi.org/10.1007/978-3-031-33620-1_21
Publikováno v:
ACM Transactions on Software Engineering and Methodology
ACM Transactions on Software Engineering and Methodology, 2022, 31 (4), pp.1-36. ⟨10.1145/3502851⟩
ACM Transactions on Software Engineering and Methodology, 2022, 31 (4), pp.1-36. ⟨10.1145/3502851⟩
Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal information. In this work, we consider that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d66ca4bfeb114d72fcf4b6eef2775411
http://arxiv.org/abs/2206.05438
http://arxiv.org/abs/2206.05438
Publikováno v:
IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control, 2022, 67 (1), pp.75-88. ⟨10.1109/TAC.2020.3046578⟩
IEEE Transactions on Automatic Control, 2022, 67 (1), pp.75-88. ⟨10.1109/TAC.2020.3046578⟩
International audience; We consider the problem of synthesizing controllers for real-time systems where some timing features are not known with precision. We model the plant as a parametric timed automaton (PTA), i.e., a finite automaton equipped wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6cd0eed161c1b38ff6fb1c668a2c66f
https://hal.science/hal-03561476
https://hal.science/hal-03561476
Publikováno v:
Discrete Event Dynamic Systems
Discrete Event Dynamic Systems, Springer Verlag, 2021, ⟨10.1007/s10626-020-00333-x⟩
Discrete Event Dynamic Systems, Springer Verlag, 2021, ⟨10.1007/s10626-020-00333-x⟩
The synthesis of controllers for reactive systems can be done by computing winning strategies in two-player games. Timed (game) Automata are an appropriate formalism to model real-time embedded systems but are not easy to use for controller synthesis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbfd6d8d64e216c1e64a4f8b9e192e95
https://hal.archives-ouvertes.fr/hal-03103458
https://hal.archives-ouvertes.fr/hal-03103458
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030681944
LATA
LATA
We consider weighted graphs with parameterized weights and we propose an algorithm that, given such a graph and a source node, builds a collection of trees, each one describing the shortest paths from the source to all the other nodes of the graph fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0cfb2b17088be8bce5440ac1d8f5f01
https://doi.org/10.1007/978-3-030-68195-1_22
https://doi.org/10.1007/978-3-030-68195-1_22
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783030769826
Petri Nets
PETRI NETS 2021-42nd International Conference on Applications and Theory of Petri Nets and Concurrency
PETRI NETS 2021-42nd International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2021, Paris, France. pp.76-92, ⟨10.1007/978-3-030-76983-3_5⟩
Petri Nets
PETRI NETS 2021-42nd International Conference on Applications and Theory of Petri Nets and Concurrency
PETRI NETS 2021-42nd International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2021, Paris, France. pp.76-92, ⟨10.1007/978-3-030-76983-3_5⟩
International audience; We address concurrent games with a qualitative notion of time with parity objectives. This setting allows to express how potential controllers interact with their environment and more specifically includes relevant features: t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::102101727710c73bbafed8cd1154fb81
https://doi.org/10.1007/978-3-030-76983-3_5
https://doi.org/10.1007/978-3-030-76983-3_5
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783030769826
Petri Nets
Petri Nets
In recent works we proposed a lazy algorithm for reachability analysis in networks of automata. This algorithm is optimistic and tries to take into account as few automata as possible to perform its task. In this paper we extend the approach to the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fdf625906af967758708bebba3acb7b
https://doi.org/10.1007/978-3-030-76983-3_18
https://doi.org/10.1007/978-3-030-76983-3_18