Synthesis of Safe Message-Passing Systems

DOI10.1007/978-3-540-77050-3_23zbMath1135.68497OpenAlexW1533264240MaRDI QIDQ5458841

Nicolas Baudru, Rémi Morin

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_23

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items (1)

Realizability of concurrent recursive programs

Cites Work

• Unnamed Item
• Recognizable languages in concurrency monoids
• Representation of computations in concurrent automata by dependence orders
• Realizability and verification of MSC graphs
• Bounded time-stamping in message-passing systems
• Regular sets of infinite message sequence charts
• Infinite-state high-level MSCs: model-checking and realizability
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• Message-passing automata are expressively equivalent to EMSO logic
• A theory of regular MSC languages

This page was built for publication: Synthesis of Safe Message-Passing Systems