Lazy Reachability Analysis in Distributed Systems

DOI10.4230/LIPIcs.CONCUR.2016.17zbMath1392.68305OpenAlexW2548863071MaRDI QIDQ4608669

Didier Lime, Loïg Jezequel

Publication date: 21 March 2018

Full work available at URL: https://hal.science/hal-01699311

zbMATH Keywords

automatareachability analysiscompositional verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (4)

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ The Automatic Detection of Token Structures and Invariants Using SAT Checking ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ A lazy query scheme for reachability analysis in Petri nets

This page was built for publication: Lazy Reachability Analysis in Distributed Systems