Unifying Petri Net Semantics with Token Flows

DOI10.1007/978-3-642-02424-5_2zbMath1242.68179OpenAlexW1506169173MaRDI QIDQ3636837

Jörg Desel, Robert Lorenz, Gabriel Juhás

Publication date: 30 June 2009

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/55415/55415.pdf

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• Executability of scenarios in Petri nets
• Formal methods: Foundations and applications. 12th Brazilian symposium on formal methods, SBMF 2009, Gramado, Brazil, August 19--21, 2009. Revised selected papers
• Modeling concurrency with partial orders
• The equational theory of pomsets
• Sequential and concurrent behaviour in Petri net theory
• Axiomatizing the algebra of net computations and processes
• The non-sequential behaviour of Petri nets
• Faster Unfolding of General Petri Nets Based on Token Flows
• Towards Synthesis of Petri Nets from Scenarios
• Developments in Language Theory
• Applications and Theory of Petri Nets 2005

This page was built for publication: Unifying Petri Net Semantics with Token Flows