Connecting open systems of communicating finite state machines

DOI10.1016/J.JLAMP.2019.07.004MaRDI QIDQ2011202zbMATH OpenOpenAlexFDO

Authors Franco Barbanera, Ugo de'Liguoro, Rolf Hennicker

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)

Recommendations

• Multiparty session types meet communicating automata
• On Communicating Finite-State Machines
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• Boundedness, empty channel detection, and synchronization for communicating finite automata

Cites work

• A calculus of global interaction based on session types
• Channel Properties of Asynchronously Composed Petri Nets
• Choreographies, logically
• Compatibility in a multi-component environment
• Compatibility properties of synchronously and asynchronously communicating components
• Decidable topologies for communicating automata with FIFO and bag channels
• From communicating machines to graphical choreographies
• Global progress for dynamically interleaved multiparty sessions
• Modal I/O Automata for Interface and Product Line Theories
• Modeling and analysis of communicating systems
• Multiparty session types meet communicating automata
• On Communicating Finite-State Machines
• On global types and multi-party sessions
• On the progress of communication between two finite state machines
• On the undecidability of asynchronous session subtyping
• On weak modal compatibility, refinement, and the MIO workbench
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Verification of programs with half-duplex communication

Cited in

(4)

• Composition of synchronous communicating systems
• Multiparty session types meet communicating automata
• Composition and decomposition of multiparty sessions
• On Composing Communicating Systems

Describes a project that uses

Uses Software

• MIO Workbench

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

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