Solving finite-linear-path CTL-formulas using the CEGAR approach

DOI10.1007/978-3-662-63079-2_7zbMath1464.68253OpenAlexW3130541796MaRDI QIDQ2032844

Karsten Schmidt, Torsten Liebke

Publication date: 14 June 2021

Full work available at URL: https://doi.org/10.1007/978-3-662-63079-2_7

zbMATH Keywords

verificationPetri netsstructural analysisILPCEGAR

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)

Cites Work

• Unnamed Item
• Tools and algorithms for the construction and analysis of systems. 25 years of TACAS: TOOLympics, held as part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings. Part III
• Extensions to the CEGAR Approach on Petri Nets
• New Search Strategies for the Petri Net CEGAR Approach
• Applying CEGAR to the Petri Net State Equation
• Taking Some Burden Off an Explicit CTL Model Checker

This page was built for publication: Solving finite-linear-path CTL-formulas using the CEGAR approach