Abstract processes of place/transition systems

DOI10.1016/j.ipl.2011.03.013zbMath1260.68282arXiv1103.5916OpenAlexW2114472265MaRDI QIDQ1944098

Jens-Wolfhard Schicke, Robert J. van Glabbeek, Goltz, Ursula

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.5916

zbMATH Keywords

Petri netsconcurrencycausal semanticsprocessesP/T systems

Mathematics Subject Classification ID

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

Related Items (9)

Comparative trace semantics of time Petri nets ⋮ Synchronous and asynchronous communication(s) between three parties ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing ⋮ Unnamed Item ⋮ Abstract processes and conflicts in place/transition systems ⋮ On Causal Semantics of Petri Nets ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Abstract processes in the absence of conflicts in general place/transition systems

Cites Work

• Unnamed Item
• Configuration structures, event structures and Petri nets
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• Executions: A new partial-order semantics of Petri nets
• A trace semantics for Petri nets
• Axiomatizing the algebra of net computations and processes
• The non-sequential behaviour of Petri nets
• On the semantics of place/transition Petri nets
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Abstract processes of place/transition systems