A lazy query scheme for reachability analysis in Petri nets
From MaRDI portal
Publication:2117184
DOI10.1007/978-3-030-76983-3_18zbMath1489.68161MaRDI QIDQ2117184
Bastien Sérée, Loïg Jezequel, Didier Lime
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_18
68W05: Nonnumerical algorithms
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Uses Software
Cites Work
- Unnamed Item
- A structure to decide reachability in Petri nets
- Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
- Stubborn Sets for Simple Linear Time Properties
- Program Slicing
- Directed Unfolding of Petri Nets
- An Algorithm for the General Petri Net Reachability Problem
- Lazy Reachability Analysis in Distributed Systems
- Demystifying Reachability in Vector Addition Systems
- Reachability in Petri Nets with Inhibitor Arcs
- On Petri Nets with Hierarchical Special Arcs
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Formal Methods for the Design of Real-Time Systems