Decidable Topologies for Communicating Automata with FIFO and Bag Channels

DOI10.1007/978-3-662-44584-6_20zbMath1417.68125OpenAlexW1553276218MaRDI QIDQ3190124

Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_20

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 (10)

Event-B-Supported Choreography-Defined Communicating Systems ⋮ Automated verification of automata communicating via FIFO and bag buffers ⋮ Orchestrated session compliance ⋮ Unnamed Item ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Connecting open systems of communicating finite state machines ⋮ Unnamed Item ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency ⋮ Unnamed Item

This page was built for publication: Decidable Topologies for Communicating Automata with FIFO and Bag Channels