Can we communicate? Using dynamic logic to verify team automata

DOI10.1007/978-3-031-27481-7_9zbMath1529.68165MaRDI QIDQ6174530

Rolf Hennicker, Guillermina Cledou, José Proença, Maurice H. ter Beek

Publication date: 17 August 2023

Published in: Formal Methods (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

A Theory of Formal Choreographic Languages ⋮ Research Challenges in Orchestration Synthesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compatibility in a multi-component environment
• Vector team automata
• A generic framework for \(n\)-protocol compatibility checking
• Modularity for teams of I/O automata
• Compositionality of safe communication in systems of team automata
• Moving from interface theories to assembly theories
• Richer interface automata with optimistic and pessimistic compatibility
• Automata for Specifying and Orchestrating Service Contracts
• A theory of contracts for web services
• Compliance in Behavioural Contracts: A Brief Survey
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• On Communicating Finite-State Machines
• Modal I/O Automata for Interface and Product Line Theories
• Formal Techniques for Networked and Distributed Systems - FORTE 2003

This page was built for publication: Can we communicate? Using dynamic logic to verify team automata