An SMT-Based Approach to Coverability Analysis
From MaRDI portal
Publication:2920990
DOI10.1007/978-3-319-08867-9_40zbMath1487.68156OpenAlexW408676302MaRDI QIDQ2920990
Philipp J. Meyer, Filip Niksic, Javier Esparza, Rupak Majumdar, Ruslán Ledesma Garza
Publication date: 29 September 2014
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08867-9_40
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 (17)
Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data ⋮ Coverability in 2-VASS with one unary counter is in NP ⋮ Modular rewritable Petri nets: an efficient model for dynamic distributed systems ⋮ Unnamed Item ⋮ Population protocols: beyond runtime analysis ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Directed reachability for infinite-state systems ⋮ Occam's razor applied to the Petri net coverability problem ⋮ Unbounded-Thread Program Verification using Thread-State Equations ⋮ Towards efficient verification of population protocols ⋮ Commodification of accelerations for the Karp and Miller construction ⋮ Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems ⋮ Computing parameterized invariants of parameterized Petri nets ⋮ On the combination of polyhedral abstraction and SMT-based model checking for Petri nets ⋮ Abstraction-based incremental inductive coverability for Petri nets
Uses Software
This page was built for publication: An SMT-Based Approach to Coverability Analysis
