Can we communicate? Using dynamic logic to verify team automata
From MaRDI portal
Publication:6174530
DOI10.1007/978-3-031-27481-7_9zbMATH Open1529.68165MaRDI QIDQ6174530FDOQ6174530
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)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Communicating Finite-State Machines
- Title not available (Why is that?)
- A theory of contracts for web services
- A generic framework for \(n\)-protocol compatibility checking
- Title not available (Why is that?)
- Modal I/O Automata for Interface and Product Line Theories
- Compliance in Behavioural Contracts: A Brief Survey
- On Weak Modal Compatibility, Refinement, and the MIO Workbench
- Compatibility in a multi-component environment
- Title not available (Why is that?)
- Vector team automata
- Title not available (Why is that?)
- Modularity for teams of I/O automata
- Formal Techniques for Networked and Distributed Systems - FORTE 2003
- Title not available (Why is that?)
- Compositionality of safe communication in systems of team automata
- Automata for Specifying and Orchestrating Service Contracts
- Moving from interface theories to assembly theories
- Richer interface automata with optimistic and pessimistic compatibility
- Featured Team Automata
Cited In (5)
This page was built for publication: Can we communicate? Using dynamic logic to verify team automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174530)
