Partial Order Semantics of Types of Nets

DOI10.1007/978-3-540-95891-8_36zbMath1206.68216OpenAlexW1556099246MaRDI QIDQ3599087

Gabriel Juhás, Robert Lorenz, Sebastian Mauser

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Partial (set) 2-structures. I: Basic notions and the representation problems
• From Petri nets to automata with concurrency
• The synthesis of Petri nets from path-automatic specifications
• Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios
• Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial Order Semantics of Types of Nets