Parallelisation of the Petri net unfolding algorithm

DOI10.1007/3-540-46002-0_26MaRDI QIDQ4472254zbMATH OpenFDO

Authors Keijo Heljanko, Victor Khomenko, Maciej Koutny

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2280/22800371.htm

zbMATH Keywords

causalityconcurrencyModel checkingparallel algorithmsPetri netsunfolding

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) Parallel algorithms in computer science (68W10)

Recommendations

• Towards an efficient algorithm for unfolding Petri nets
• Faster Unfolding of General Petri Nets Based on Token Flows
• Canonical prefixes of Petri net unfoldings
• Unfoldings of unbounded Petri nets
• Parallel LTL-X model checking of high-level Petri nets based on unfoldings

Cited in

(11)

• Dealing with practical limitations of distributed timed model checking for timed automata
• Computation of summaries using net unfoldings
• scientific article; zbMATH DE number 3890722 (Why is no real title available?)
• Planning without state space explosion: Petri net to Markov decision process
• Faster Unfolding of General Petri Nets Based on Token Flows
• Recent advances in unfolding technique
• An unfolding algorithm for synchronous products of transition systems
• Towards an efficient algorithm for unfolding Petri nets
• Canonical prefixes of Petri net unfoldings
• Model checking of biological systems
• Parallel LTL-X model checking of high-level Petri nets based on unfoldings

This page was built for publication: Parallelisation of the Petri net unfolding algorithm

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