Verification of Parameterized Communicating Automata via Split-Width

DOI10.1007/978-3-662-49630-5_12zbMath1475.68182OpenAlexW2464539450MaRDI QIDQ2811340

Paul Gastin, Marie Fortin

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49630-5_12

zbMATH Keywords

model checkingmessage sequence chartsparameterized distributed systemssplit-width

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

Data Multi-Pushdown Automata

Cites Work

• Unnamed Item
• Unnamed Item
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• MSO Decidability of Multi-Pushdown Systems via Split-Width
• Parameterized Model Checking of Token-Passing Systems
• On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
• Parameterized Model Checking of Rendezvous Systems
• Parameterized Verification of Communicating Automata under Context Bounds
• Verifying Communicating Multi-pushdown Systems via Split-Width
• Parameterized Verification of Ad Hoc Networks
• On Communicating Finite-State Machines
• Logic for communicating automata with parameterized topology
• On Reasoning About Rings
• Tools and Algorithms for the Construction and Analysis of Systems
• Model checking parameterized asynchronous shared-memory systems