Ten years of saturation: a Petri net perspective
DOI10.1007/978-3-642-29072-5_3zbMATH Open1350.68199OpenAlexW1626572155MaRDI QIDQ2889608FDOQ2889608
Authors: Gianfranco Ciardo, Xiao-Qing Jin, Yang Zhao
Publication date: 8 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29072-5_3
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (7)
- Nested-unit Petri nets
- P-Semiflow Computation with Decision Diagrams
- Efficient decomposition algorithm for stationary analysis of complex stochastic Petri net models
- New search strategies for the Petri net CEGAR approach
- Getting the priorities right: saturation for prioritised Petri nets
- Symbolic termination and confluence checking for ECA rules
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
Uses Software
This page was built for publication: Ten years of saturation: a Petri net perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889608)