Weak Time Petri Nets Strike Back!

DOI10.1007/978-3-642-04081-8_37zbMath1254.68180OpenAlexW2145580394MaRDI QIDQ3184699

Arnaud Sangnier, Pierre-Alain Reynier

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_37

Mathematics Subject Classification ID

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

Related Items (8)

Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis ⋮ Weak Time Petri Nets Strike Back! ⋮ Waiting nets ⋮ `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies ⋮ Waiting Nets: State Classes and Taxonomy ⋮ Analysis and design of molecular machines ⋮ Combining free choice and time in Petri nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency

Cites Work

• Complexity of some problems in Petri nets
• A theory of timed automata
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Parallel program schemata
• Weak Time Petri Nets Strike Back!
• An Algorithm for the General Petri Net Reachability Problem
• Compositional specification of timed systems
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Automated Technology for Verification and Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak Time Petri Nets Strike Back!