Unfolding based alorithms for the reachability problem

MaRDI QIDQ2775861zbMATH OpenFDO

Authors Javier Esparza, Claus Schröter

Publication date 28 February 2002

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

Petri nets

Mathematics Subject Classification ID

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

Recommendations

• Goal-driven unfolding of Petri nets
• Directed Unfolding of Petri Nets
• Efficient algorithms for three reachability problems in safe Petri nets
• scientific article; zbMATH DE number 1863174
• SAT-solving the coverability problem for Petri nets

Cited in

(7)

• SAT-solving the coverability problem for Petri nets
• Efficient algorithms for three reachability problems in safe Petri nets
• Parameter space abstraction and unfolding semantics of discrete regulatory networks
• State space analysis of Petri nets with relation-algebraic methods
• Directed Unfolding of Petri Nets
• Goal-driven unfolding of Petri nets
• Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm

This page was built for publication: Unfolding based alorithms for the reachability problem

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