Parameterized communicating automata: complementation and model checking

DOI10.4230/LIPICS.FSTTCS.2014.625MaRDI QIDQ2978552zbMATH OpenFDO

Authors Benedikt Bollig, Paul Gastin, Akshay Kumar

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2014.625

zbMATH Keywords

complementationmonadic second-order logicparameterized verification

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) 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
• 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

Cited in

(7)

• On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• On the decidability of correctness problems for a communicating automata net
• Verification of parameterized communicating automata via split-width
• Parameterized Verification of Communicating Automata under Context Bounds
• Logic for communicating automata with parameterized topology
• Generalized Communicating P 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)