Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic
PPDP '24: Proceedings of the 26th International Symposium on Principles and Practice of Declarative ProgrammingSeptember 2024, Article No.: 10, Pages 1–14https://doi.org/10.1145/3678232.3678240Strategic Timed CTL (STCTL) is an expressive logic that integrates branching time CTL with the representation of continuous time, and the notion of strategic abilities of agents. This makes STCTL suitable for specifying properties of asynchronous multi-...
- ArticleJune 2024
CosyVerif: The Path to Formalisms Cohabitation
- Étienne André,
- Jaime Arias,
- Benoît Barbot,
- Francis Hulin-Hubard,
- Fabrice Kordon,
- Van-François Le,
- Laure Petrucci
Application and Theory of Petri Nets and ConcurrencyJun 2024, Pages 432–444https://doi.org/10.1007/978-3-031-61433-0_21AbstractMore and more model checking approaches rely nowadays on several inputs, potentially expressed in different formalisms. Tools implementing these usually include only the expected formalisms. Thus, such tools are ad-hoc and lack extensibility and ...
- ArticleApril 2024
On-The-Fly Algorithm for Reachability in Parametric Timed Games
Tools and Algorithms for the Construction and Analysis of SystemsApr 2024, Pages 194–212https://doi.org/10.1007/978-3-031-57256-2_10AbstractParametric Timed Games (PTG) are an extension of the model of Timed Automata. They allow for the verification and synthesis of real-time systems, reactive to their environment and depending on adjustable parameters. Given a PTG and a reachability ...
- research-articleApril 2024
Symbolic analysis and parameter synthesis for networks of parametric timed automata with global variables using Maude and SMT solving
Science of Computer Programming (SCPR), Volume 233, Issue CMar 2024https://doi.org/10.1016/j.scico.2023.103074AbstractThis paper presents a rewriting logic “interpreter” for networks of parametric timed automata with global variables (NPTAVs) in Real-Time Maude style. Since explicit-state analysis is not sound and complete for such dense-time systems, we explain ...
- research-articleJanuary 2024
Correctness Notions for Petri Nets with Identifiers
- Jan Martijn E.M. van der Werf,
- Andrey Rivkin,
- Marco Montali,
- Artem Polyvyanyy,
- Luca Bernardinello,
- Jetty Kleijn,
- Laure Petrucci
Fundamenta Informaticae (FUNI), Volume 190, Issue 2-42024, Pages 159–207https://doi.org/10.3233/FI-242169A model of an information system describes its processes and how resources are involved in these processes to manipulate data objects. This paper presents an extension to the Petri nets formalism suitable for describing information systems in which ...
-
- research-articleJanuary 2024
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
Fundamenta Informaticae (FUNI), Volume 190, Issue 2-42024, Pages 109–158https://doi.org/10.3233/FI-242168In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, Petri nets form a theoretically well-explored description language and are ...
- research-articleJanuary 2024
Waiting Nets: State Classes and Taxonomy
Fundamenta Informaticae (FUNI), Volume 190, Issue 2-42024, Pages 63–107https://doi.org/10.3233/FI-242167In time Petri nets (TPNs), time and control are tightly connected: time measurement for a transition starts only when all resources needed to fire it are available. Further, upper bounds on duration of enabledness can force transitions to fire (this is ...
- ArticleJune 2023
Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving
Application and Theory of Petri Nets and ConcurrencyJun 2023, Pages 369–392https://doi.org/10.1007/978-3-031-33620-1_20AbstractIn this paper we present a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs). We show how this allows us to use Maude combined with SMT solving to provide sound and complete formal ...
- research-articleMay 2023
Strategic (Timed) Computation Tree Logic
AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent SystemsMay 2023, Pages 382–390We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, ie STCTL is interpreted over networks of ...
- research-articleDecember 2022
Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata
FTSCS 2022: Proceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical SystemsNovember 2022, Pages 3–15https://doi.org/10.1145/3563822.3569923This paper presents a rewriting logic semantics for parametric timed automata (PTAs) and shows that symbolic reachability analysis using Maude-with-SMT is sound and complete for the PTA reachability problem. We then refine standard Maude-with-SMT ...
- ArticleOctober 2022
Modular Analysis of Tree-Topology Models
Formal Methods and Software EngineeringOct 2022, Pages 36–53https://doi.org/10.1007/978-3-031-17244-1_3AbstractNetworks of automata that synchronise over shared actions are organised according to a graph synchronisation topology. In this topology two automata are connected if they can jointly execute some action. We present a very effective reduction for ...
- ArticleSeptember 2022
Efficient Convex Zone Merging in Parametric Timed Automata
Formal Modeling and Analysis of Timed SystemsSep 2022, Pages 200–218https://doi.org/10.1007/978-3-031-15839-1_12AbstractParametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. Reducing their state space is a significant way to reduce the inherently large analysis times. We present ...
- research-articleNovember 2022
Distributed parametric model checking timed automata under non-Zenoness assumption
Formal Methods in System Design (FMSD), Volume 59, Issue 1-3Dec 2021, Pages 253–290https://doi.org/10.1007/s10703-022-00400-zAbstractModel checking timed systems may be negatively impacted by the presence of Zeno runs as counterexamples. Such runs contain an infinite number of discrete actions occurring in a finite time, which is unrealistic; therefore, these runs must be ...
- ArticleSeptember 2021
Fault-Tolerant LU Factorization Is Low Cost
Euro-Par 2021: Parallel ProcessingSep 2021, Pages 536–549https://doi.org/10.1007/978-3-030-85665-6_33AbstractAt large scale, failures are statistically frequent and need to be taken into account. Tolerating failures has arisen as a major challenge in parallel computing as the size of the systems grow, failures become more common and some computation ...
- research-articleJuly 2021
- demonstrationMay 2021
ADT2AMAS: Managing Agents in Attack-Defence Scenarios
AAMAS '21: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent SystemsMay 2021, Pages 1749–1751Expressing attack-defence trees (ADTrees) in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact the performance of attacking and defending strategies executed by ...
- ArticleMarch 2021
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata
Tools and Algorithms for the Construction and Analysis of SystemsMar 2021, Pages 311–329https://doi.org/10.1007/978-3-030-72016-2_17AbstractWe study semi-algorithms to synthesise the constraints under which a Parametric Timed Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite parametric zone graph, searching for accepting cycles. We provide new ...