Dynamic Networks of Timed Petri Nets

DOI10.1007/978-3-319-07734-5_16zbMath1410.68256OpenAlexW94250176WikidataQ57831192 ScholiaQ57831192MaRDI QIDQ5166770

Fernando Rosa-Velardo, María Martos-Salgado

Publication date: 8 July 2014

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-07734-5_16

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Localities in systems with a/sync communication
• Decidability and complexity of Petri nets with unordered data
• Algorithmic analysis of programs with well quasi-ordered domains.
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• ω-Petri Nets
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Expressiveness of Dynamic Networks of Timed Petri Nets
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Ordering by Divisibility in Abstract Algebras
• Well-structured transition systems everywhere!

This page was built for publication: Dynamic Networks of Timed Petri Nets