Simplification of CTL formulae for efficient model checking of Petri nets
From MaRDI portal
Publication:2280185
DOI10.1007/978-3-319-91268-4_8zbMath1427.68161OpenAlexW2802268138MaRDI QIDQ2280185
Jiří Srba, Jakob Dyhr, Mads Johannsen, Frederik M. Bønneland, Peter Gjøl Jensen
Publication date: 18 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-319-91268-4_8
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (7)
Skeleton Abstraction for Universal Temporal Properties ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Using approximation for the verification of token-scaling models ⋮ Structural Reductions Revisited ⋮ Taking Some Burden Off an Explicit CTL Model Checker ⋮ Symbolic and Structural Model-Checking ⋮ Skeleton abstraction for universal temporal properties
Uses Software
This page was built for publication: Simplification of CTL formulae for efficient model checking of Petri nets
