Logic for communicating automata with parameterized topology

DOI10.1145/2603088.2603093zbMATH Open1401.68223OpenAlexW2033652352WikidataQ130853237 ScholiaQ130853237MaRDI QIDQ4635601FDOQ4635601

Authors: Benedikt Bollig 

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603093

Recommendations

• Parameterized communicating automata: complementation and model checking
• Parameterized Verification of Communicating Automata under Context Bounds
• Verification of parameterized communicating automata via split-width
• scientific article; zbMATH DE number 1490952
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata

zbMATH Keywords

monadic second-order logicrealizabilitycommunicating automatamessage sequence chartsparameterized topology

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• Verification of parameterized communicating automata via split-width
• Parameterized Verification of Communicating Automata under Context Bounds
• Parameterized communicating automata: complementation and model checking

This page was built for publication: Logic for communicating automata with parameterized topology

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