Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
From MaRDI portal
Publication:4914290
DOI10.3233/FI-2013-781zbMath1282.68175MaRDI QIDQ4914290
Pierre-Alain Reynier, Frédéric Servais
Publication date: 18 April 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) 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 (3)
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning ⋮ Commodification of accelerations for the Karp and Miller construction ⋮ Stop-transitions of Petri Nets*
Uses Software
This page was built for publication: Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
