Waiting Nets: State Classes and Taxonomy
From MaRDI portal
Publication:6189319
DOI10.3233/fi-242167arXiv2211.10540OpenAlexW4391346710WikidataQ129058611 ScholiaQ129058611MaRDI QIDQ6189319
Publication date: 8 February 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.10540
Cites Work
- Complexity results for 1-safe nets
- Model checking of time Petri nets using the state class timed automaton
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- When are timed automata weakly timed bisimilar to time Petri nets?
- Complexity of some problems in Petri nets
- The covering and boundedness problems for vector addition systems
- A theory of timed automata
- The expressive power of time Petri nets
- Timed Petri nets with reset for pipelined synchronous circuit design
- Waiting nets
- Combining free choice and time in Petri nets
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- Fourier-Motzkin elimination and its dual
- Decidable Classes of Unbounded Petri Nets with Time and Urgency
- Weak Time Petri Nets Strike Back!
- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
- Removing ε-transitions in timed automata
- Formal Modeling and Analysis of Timed Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
