A trace semantics for Petri Nets

DOI10.1007/3-540-55719-9_107zbMath1427.68199OpenAlexW237151715MaRDI QIDQ5204350

P. S. Thiagarajan, P. W. Hoogers, H. C. M. Kleijn

Publication date: 4 December 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_107

zbMATH Keywords

Petri nettrace semantics

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)

Related Items (1)

Polynomial algorithms for the synthesis of bounded nets

Cites Work

• Partial (set) 2-structures. II: State spaces of concurrent systems
• Sequential and concurrent behaviour in Petri net theory
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• A trace semantics for Petri nets
• The non-sequential behaviour of Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A trace semantics for Petri Nets