Parameterized communicating automata: complementation and model checking

DOI10.4230/LIPICS.FSTTCS.2014.625zbMATH Open1360.68577MaRDI QIDQ2978552FDOQ2978552

Authors: Benedikt Bollig, Paul Gastin, Akshay Kumar 

Publication date: 25 April 2017

Recommendations

• Parameterized Verification of Communicating Automata under Context Bounds
• Logic for communicating automata with parameterized topology
• Verification of parameterized communicating automata via split-width
• Parameterized compositional model checking
• Parameterized model checking of rendezvous systems

zbMATH Keywords

monadic second-order logiccomplementationparameterized verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (6)

• On the decidability of correctness problems for a communicating automata net
• Generalized Communicating P Automata
• Parameterized Verification of Communicating Automata under Context Bounds
• On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
• Verification of Parameterized Communicating Automata via Split-Width
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata

This page was built for publication: Parameterized communicating automata: complementation and model checking

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