Taking Some Burden Off an Explicit CTL Model Checker

DOI10.1007/978-3-030-21571-2_18OpenAlexW2950829809MaRDI QIDQ6184728

Karsten Schmidt, Torsten Liebke

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-030-21571-2_18

zbMATH Keywords

partial order reductionCTL model checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (3)

Automata-driven partial order reduction and guided search for LTL model checking ⋮ Using approximation for the verification of token-scaling models ⋮ Solving finite-linear-path CTL-formulas using the CEGAR approach

Cites Work

• Question-guided stubborn set methods for state properties
• A partial approach to model checking
• A partial order approach to branching time logic model checking.
• Simplification of CTL formulae for efficient model checking of Petri nets
• More efficient on-the-fly LTL verification with Tarjan's algorithm
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
• New Algorithms for Deciding the Siphon-Trap Property
• Stubborn Set Intuition Explained
• Model Checking Software
• Depth-First Search and Linear Graph Algorithms
• Applying CEGAR to the Petri Net State Equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Taking Some Burden Off an Explicit CTL Model Checker