scientific article; zbMATH DE number 6825411

DOI10.23638/LMCS-14(1:1)2018zbMath1464.68030arXiv1611.03656MaRDI QIDQ4600773

Michel Bidoit, Rolf Hennicker

Publication date: 12 January 2018

Full work available at URL: https://arxiv.org/abs/1611.03656

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distributed systemssynchronous and asynchronous communicationverification of interaction compatibility

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (2)

Can we communicate? Using dynamic logic to verify team automata ⋮ Connecting open systems of communicating finite state machines

Cites Work

• Compatibility in a multi-component environment
• Compositionality of safe communication in systems of team automata
• Verification of programs with half-duplex communication
• A Modal Interface Theory for Component-based Design
• Synchronizing Asynchronous Conformance Testing
• Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• On Communicating Finite-State Machines
• Channel Properties of Asynchronously Composed Petri Nets
• Context-Bounded Analysis of Concurrent Queue Systems
• Modal I/O Automata for Interface and Product Line Theories
• Compatibility and inheritance in software architectures

This page was built for publication: