Taking Some Burden Off an Explicit CTL Model Checker
From MaRDI portal
Publication:6184728
DOI10.1007/978-3-030-21571-2_18OpenAlexW2950829809MaRDI QIDQ6184728FDOQ6184728
Authors: Torsten Liebke, Karsten Wolf
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- TAPAAL 2.0: integrated development environment for timed-arc Petri nets
- Depth-First Search and Linear Graph Algorithms
- New algorithms for deciding the siphon-trap property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model Checking Software
- Question-guided stubborn set methods for state properties
- Title not available (Why is that?)
- A partial approach to model checking
- A partial order approach to branching time logic model checking.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stubborn set intuition explained
- Title not available (Why is that?)
- More efficient on-the-fly LTL verification with Tarjan's algorithm
- Simplification of CTL formulae for efficient model checking of Petri nets
- Applying CEGAR to the Petri net state equation
Cited In (3)
This page was built for publication: Taking Some Burden Off an Explicit CTL Model Checker
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184728)