Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows

DOI10.1007/978-3-642-38697-8_18zbMath1335.68163OpenAlexW1759765785MaRDI QIDQ5300880

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

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)

Related Items (1)

Firing partial orders in a Petri net

This page was built for publication: Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows