Decidable Classes of Unbounded Petri Nets with Time and Urgency

DOI10.1007/978-3-319-39086-4_18zbMath1346.68125OpenAlexW2506850889MaRDI QIDQ2822660

Blaise Genest, Loïc Hélouët, S. Akshay

Publication date: 4 October 2016

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39086-4_18

Mathematics Subject Classification ID

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

Related Items (3)

Waiting nets ⋮ Waiting Nets: State Classes and Taxonomy ⋮ Combining free choice and time in Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Robust safety of timed automata
• Complexity of some problems in Petri nets
• The expressive power of time Petri nets
• Dynamical properties of timed automata
• Back in Time Petri Nets
• Verification of Timed-Arc Petri Nets
• Weak Time Petri Nets Strike Back!
• Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
• Robustness of Time Petri Nets under Guard Enlargement
• Reachability of Communicating Timed Processes
• Soundness of Timed-Arc Workflow Nets
• Robustness in Timed Automata
• On Multi-enabledness in Time Petri Nets
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Automated Technology for Verification and Analysis
• From Time Petri Nets to Timed Automata: An Untimed Approach
• Well-structured transition systems everywhere!

This page was built for publication: Decidable Classes of Unbounded Petri Nets with Time and Urgency