On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems

DOI10.1007/11916277_24zbMath1165.68397arXivcs/0606091OpenAlexW3100374687MaRDI QIDQ5387903

Nathalie Bertrand, Christel Baier, Philippe Schnoebelen

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0606091

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

On termination and invariance for faulty channel machines ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ The complexity of synchronizing Markov decision processes ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness ⋮ On Verifying Fault Tolerance of Distributed Protocols ⋮ Stochastic Games with Lossy Channels ⋮ The ω-Regular Post Embedding Problem ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems