Synthesis of Safe Message-Passing Systems

DOI10.1007/978-3-540-77050-3_23zbMATH Open1135.68497OpenAlexW1533264240MaRDI QIDQ5458841FDOQ5458841

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1759633
• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Infinite-state high-level MSCs: model-checking and realizability
• Analysis of a class of communicating finite state machines

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• Compositionality of safe communication in systems of team automata
• Modal Interface Theories for Communication-Safe Component Assemblies
• Realizability of concurrent recursive programs

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

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