Waiting nets

DOI10.1007/978-3-031-06653-5_4zbMath1499.68226OpenAlexW4285308543MaRDI QIDQ2165233

Loïc Hélouët, Pranay Agrawal

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_4

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Waiting Nets: State Classes and Taxonomy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• Combining free choice and time in Petri nets
• Decidable Classes of Unbounded Petri Nets with Time and Urgency
• Verification of Timed-Arc Petri Nets
• Weak Time Petri Nets Strike Back!
• Removing ε-transitions in timed automata
• Lectures on Concurrency and Petri Nets

This page was built for publication: Waiting nets