Using transition set sequences to partition behaviors of Petri nets

DOI10.1007/S00236-011-0147-6zbMath1234.68311OpenAlexW1964132770MaRDI QIDQ766188

Yunhe Wang, Li Jiao

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-011-0147-6

zbMATH Keywords

equivalence classessemanticsback-loopsPetri net behaviortransition set

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
• A decomposition theorem for finite persistent transition systems
• Sequential and concurrent behaviour in Petri net theory
• A partial trace semantics for Petri nets
• Semantics of inhibitor nets
• Combinatorial problems of commutation and rearrangements
• Canonical Transition Set Semantics for Petri Nets

This page was built for publication: Using transition set sequences to partition behaviors of Petri nets