A structural approach for the analysis of Petri nets by reduced unfoldings

DOI10.1007/3-540-61363-3_19MaRDI QIDQ4633172zbMATH OpenOpenAlexFDO

Authors Alex Kondratiev, Michael Kishinevsky, Alexander Taubin, Sergei Ten

Publication date 2 May 2019

Published in Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61363-3_19

zbMATH Keywords

asynchronous circuitbinary decision diagraminput placelocal configurationreachability graph

Mathematics Subject Classification ID

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

Recommendations

• A technique of state space search based on unfolding
• scientific article; zbMATH DE number 1863174
• Faster Unfolding of General Petri Nets Based on Token Flows
• scientific article; zbMATH DE number 1670797
• Goal-driven unfolding of Petri nets

Cites work

• A structural approach for the analysis of Petri nets by reduced unfoldings
• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Deriving Petri nets from finite transition systems
• scientific article; zbMATH DE number 711039 (Why is no real title available?)
• scientific article; zbMATH DE number 3273524 (Why is no real title available?)
• Model checking using net unfoldings
• Petri nets, event structures and domains. I

Cited in

(2)

• A technique of state space search based on unfolding
• A structural approach for the analysis of Petri nets by reduced unfoldings

This page was built for publication: A structural approach for the analysis of Petri nets by reduced unfoldings

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