Parameterized Model Checking of Rendezvous Systems

DOI10.1007/978-3-662-44584-6_9zbMath1417.68112OpenAlexW2735546981MaRDI QIDQ3190112

Sasha Rubin, Benjamin Aminof, Francesco Spegni, Helmut Veith, Tomer Kotek

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_9

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)

Related Items (10)

Formal verification of mobile robot protocols ⋮ Liveness of Parameterized Timed Networks ⋮ Parameterized model checking of rendezvous systems ⋮ A methodology to take credit for high-level verification during RTL verification ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates ⋮ Nash equilibria in symmetric graph games with partial observation ⋮ Verification of Parameterized Communicating Automata via Split-Width ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method

This page was built for publication: Parameterized Model Checking of Rendezvous Systems