Synthesis of Safe Message-Passing Systems
From MaRDI portal
Publication:5458841
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
Cites work
- scientific article; zbMATH DE number 4112050 (Why is no real title available?)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of regular MSC languages
- Bounded time-stamping in message-passing systems
- Infinite-state high-level MSCs: model-checking and realizability
- Message-passing automata are expressively equivalent to EMSO logic
- Realizability and verification of MSC graphs
- Recognizable languages in concurrency monoids
- Regular sets of infinite message sequence charts
- Representation of computations in concurrent automata by dependence orders
Cited in
(5)- scientific article; zbMATH DE number 1759633 (Why is no real title available?)
- 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)