Applying CEGAR to the Petri Net State Equation

DOI10.1007/978-3-642-19835-9_19zbMath1316.68079arXiv1208.2159OpenAlexW1804409858MaRDI QIDQ5892497

Harro Wimmel, Karsten Schmidt

Publication date: 19 May 2011

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.2159

zbMATH Keywords

integer programmingPetri netstructure analysisreachability problempartial order reductionCEGAR

Mathematics Subject Classification ID

Integer programming (90C10) 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 (5)

Stubborn versus structural reductions for Petri nets ⋮ New Search Strategies for the Petri Net CEGAR Approach ⋮ Structural Reductions Revisited ⋮ Finding a Witness Path for Non-liveness in Free-Choice Nets ⋮ Solving finite-linear-path CTL-formulas using the CEGAR approach

Uses Software

• lp_solve
• CEGAR

Cites Work

• Unnamed Item
• Unnamed Item
• Question-guided stubborn set methods for state properties
• A structure to decide reachability in Petri nets
• An Algorithm for the General Petri Net Reachability Problem

This page was built for publication: Applying CEGAR to the Petri Net State Equation