Using transition set sequences to partition behaviors of Petri nets

DOI10.1007/S00236-011-0147-6MaRDI QIDQ766188zbMATH OpenOpenAlexFDO

Authors 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

back-loopsequivalence classesPetri net behaviorsemanticstransition set

Mathematics Subject Classification ID

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

Recommendations

• Canonical transition set semantics for Petri nets
• scientific article; zbMATH DE number 3911720
• scientific article; zbMATH DE number 3974312
• Unifying Petri Net Semantics with Token Flows
• scientific article; zbMATH DE number 1361137

Cites work

• A decomposition theorem for finite persistent transition systems
• A partial trace semantics for Petri nets
• Canonical transition set semantics for Petri nets
• Combinatorial problems of commutation and rearrangements
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1863166 (Why is no real title available?)
• Semantics of inhibitor nets
• Sequential and concurrent behaviour in Petri net theory

Cited in

(2)

• Canonical transition set semantics for Petri nets
• Analysis of Petri nets by partitioning: Splitting transitions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766188)