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

DOI10.1007/978-3-662-63079-2_7MaRDI QIDQ2032844zbMATH OpenOpenAlexFDO

Authors Torsten Liebke, Karsten Wolf

Publication date 14 June 2021

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

zbMATH Keywords

CEGARILPPetri netsstructural analysisverification

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)

Recommendations

• Applying CEGAR to the Petri net state equation
• Applying CEGAR to the Petri net state equation
• Simplification of CTL formulae for efficient model checking of Petri nets
• New search strategies for the Petri net CEGAR approach
• Extensions to the CEGAR approach on Petri nets

Cites work

• Applying CEGAR to the Petri net state equation
• Extensions to the CEGAR approach on Petri nets
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• New search strategies for the Petri net CEGAR approach
• Taking Some Burden Off an Explicit CTL Model Checker
• 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

Cited in

(4)

• Simplification of CTL formulae for efficient model checking of Petri nets
• New search strategies for the Petri net CEGAR approach
• Applying CEGAR to the Petri net state equation
• Applying CEGAR to the Petri net state equation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032844)