Faster verification of partially ordered runs in Petri nets using compact tokenflows

DOI10.1007/978-3-642-38697-8_18zbMATH Open1335.68163OpenAlexW1759765785MaRDI QIDQ5300880FDOQ5300880

Authors: Robin Bergenthum 

Publication date: 28 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_18

Recommendations

• Verification of scenarios in Petri nets using compact tokenflows
• Executions: A new partial-order semantics of Petri nets
• Executability of scenarios in Petri nets
• Firing partial orders in a Petri net
• Applications and Theory of Petri Nets 2005

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Firing partial orders in a Petri net
• Applications and Theory of Petri Nets 2005
• Verification of scenarios in Petri nets using compact tokenflows
• Executability of scenarios in Petri nets

This page was built for publication: Faster verification of partially ordered runs in Petri nets using compact tokenflows

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