New Search Strategies for the Petri Net CEGAR Approach

DOI10.1007/978-3-319-19488-2_16zbMath1432.68308OpenAlexW585091348WikidataQ57086292 ScholiaQ57086292MaRDI QIDQ2941159

Tamás Bartha, András Vörös, Ákos Hajdu

Publication date: 27 August 2015

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/24602/1/pn_cegar_final.pdf

zbMATH Keywords

Petri netsILPreachability analysisabstractionCEGAR

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) Distributed algorithms (68W15)

Related Items (3)

Model checking Petri nets with MSVL ⋮ Solving finite-linear-path CTL-formulas using the CEGAR approach ⋮ Unbounded-Thread Program Verification using Thread-State Equations

Cites Work

• Unnamed Item
• Ten Years of Saturation: A Petri Net Perspective
• Extensions to the CEGAR Approach on Petri Nets
• Counterexample-guided abstraction refinement for symbolic model checking
• Linear Programming
• Applying CEGAR to the Petri Net State Equation
• Applying CEGAR to the Petri Net State Equation

This page was built for publication: New Search Strategies for the Petri Net CEGAR Approach