Elimination of detached regions in dependency graph verification

DOI10.1007/978-3-031-32157-3_9OpenAlexW4367664962MaRDI QIDQ6049047

Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba, Nikolaj Jensen Ulrik

Publication date: 16 October 2023

Published in: Model Checking Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-32157-3_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed computation of fixed points on dependency graphs
• Extended dependency graphs and efficient distributed fixed-point computation
• Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking
• Automatic synthesis of transiently correct network updates via Petri games
• A lattice-theoretical fixpoint theorem and its applications
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*
• Partial order reduction for reachability games
• CONCUR 2005 – Concurrency Theory
• Abstract Dependency Graphs and Their Application to Model Checking

This page was built for publication: Elimination of detached regions in dependency graph verification