An efficient algorithm for the computation of stubborn sets of well formed Petri Nets

DOI10.1007/3-540-60029-9_37zbMath1496.68219OpenAlexW2160367214MaRDI QIDQ5096362

Robert Brgan, Denis Poitrenaud

Publication date: 16 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-60029-9_37

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)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for the computation of stubborn sets of well formed Petri Nets