Efficiency of asynchronous systems and read arcs in petri nets

DOI10.1007/3-540-63165-8_209zbMath1401.68235OpenAlexW1532422145MaRDI QIDQ4571984

Walter Vogler

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_209

Mathematics Subject Classification ID

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

Related Items

Mutex needs fairness ⋮ Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ Unfolding semantics of graph transformation ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ Concurrency for Graph Grammars in a Petri net shell ⋮ Fast asynchronous systems in dense time ⋮ McMillan’s Complete Prefix for Contextual Nets ⋮ Fairness of actions in system computations ⋮ Petri net reactive modules ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ Partial order semantics and read arcs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mutex needs fairness
• Fairness and partial order semantics
• Testing equivalences for processes
• Timed testing of concurrent systems
• Contextual nets