Dynamic networks of timed Petri nets

DOI10.1007/978-3-319-07734-5_16MaRDI QIDQ5166770zbMATH OpenOpenAlexWikidataFDO

Authors María Martos-Salgado, Fernando Rosa-Velardo

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)

Recommendations

• Expressiveness of dynamic networks of timed Petri nets
• Timed processes of timed Petri nets
• scientific article; zbMATH DE number 2081112
• Universal safety for timed Petri nets is PSPACE-complete
• scientific article; zbMATH DE number 1830920

Cites work

• \(\omega \)-Petri nets
• Algorithmic analysis of programs with well quasi-ordered domains.
• Decidability and complexity of Petri nets with unordered data
• 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
• scientific article; zbMATH DE number 1696456 (Why is no real title available?)
• scientific article; zbMATH DE number 5506896 (Why is no real title available?)
• scientific article; zbMATH DE number 5506900 (Why is no real title available?)
• scientific article; zbMATH DE number 1755138 (Why is no real title available?)
• Localities in systems with a/sync communication
• Nets with tokens which carry data
• Ordering by Divisibility in Abstract Algebras
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• Well-structured transition systems everywhere!

Cited in

(16)

• Timed Petri nets with reset for pipelined synchronous circuit design
• Closed, open, and robust timed networks
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
• scientific article; zbMATH DE number 2081112 (Why is no real title available?)
• scientific article; zbMATH DE number 1755138 (Why is no real title available?)
• Dynamic networks of heterogeneous timed machines
• Universal safety for timed Petri nets is PSPACE-complete
• Regular separability of well-structured transition systems
• Heterogeneous and asynchronous networks of timed systems
• Dynamic Recursive Petri Nets
• Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
• Decidability of safety properties of timed multiset rewriting
• Expressiveness of dynamic networks of timed Petri nets
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes

This page was built for publication: Dynamic networks of timed Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166770)