Verification of parameterized communicating automata via split-width

DOI10.1007/978-3-662-49630-5_12MaRDI QIDQ2811340zbMATH OpenOpenAlexFDO

Authors Marie Fortin, Paul Gastin

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

message sequence chartsmodel checkingparameterized 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)

Recommendations

• Parameterized Verification of Communicating Automata under Context Bounds
• Verifying communicating multi-pushdown systems via split-width
• Parameterized communicating automata: complementation and model checking
• Logic for communicating automata with parameterized topology
• All for the price of few (parameterized verification through view abstraction)

Cites work

• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Graph structure and monadic second-order logic. A language-theoretic approach
• Logic for communicating automata with parameterized topology
• MSO decidability of multi-pushdown systems via split-width
• On Communicating Finite-State Machines
• On Reasoning About Rings
• On the power of cliques in the parameterized verification of ad hoc networks
• Parameterized communicating automata: complementation and model checking
• Parameterized model checking of rendezvous systems
• Parameterized Model Checking of Token-Passing Systems
• Parameterized verification of ad hoc networks
• Parameterized Verification of Communicating Automata under Context Bounds
• Tools and Algorithms for the Construction and Analysis of Systems
• Verifying communicating multi-pushdown systems via split-width

Cited in

(5)

• Parameterized communicating automata: complementation and model checking
• Parameterized Verification of Communicating Automata under Context Bounds
• Verifying communicating multi-pushdown systems via split-width
• Logic for communicating automata with parameterized topology
• Data multi-pushdown automata

This page was built for publication: Verification of parameterized communicating automata via split-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811340)