Connecting open systems of communicating finite state machines

DOI10.1016/J.JLAMP.2019.07.004zbMATH Open1435.68211OpenAlexW2971918484MaRDI QIDQ2011202FDOQ2011202

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

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

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)

Cites Work

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

Cited In (4)

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

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)