Connecting open systems of communicating finite state machines

DOI10.1016/j.jlamp.2019.07.004zbMath1435.68211OpenAlexW2971918484MaRDI QIDQ2011202

Ugo de'Liguoro, Rolf Hennicker, Franco Barbanera

Publication date: 28 November 2019

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.07.004

zbMATH Keywords

communicating finite state machinecommunicating systemcommunication propertiescomposition of open systemsglobal type with interface roles

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Composition of synchronous communicating systems ⋮ On Composing Communicating Systems ⋮ Composition and decomposition of multiparty sessions

Uses Software

• MIO Workbench

Cites Work

• Unnamed Item
• Unnamed Item
• Compatibility in a multi-component environment
• Choreographies, logically
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Verification of programs with half-duplex communication
• From Communicating Machines to Graphical Choreographies
• A Calculus of Global Interaction based on Session Types
• On Global Types and Multi-Party Session
• Multiparty Session Types Meet Communicating Automata
• On the Undecidability of Asynchronous Session Subtyping
• Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• On Communicating Finite-State Machines
• On the progress of communication between two finite state machines
• Channel Properties of Asynchronously Composed Petri Nets
• Global progress for dynamically interleaved multiparty sessions
• Modal I/O Automata for Interface and Product Line Theories

This page was built for publication: Connecting open systems of communicating finite state machines