Synthesizing distributed finite-state systems from MSCs

DOI10.1007/3-540-44618-4_37MaRDI QIDQ4536625zbMATH OpenFDO

Authors Madhavan Mukund, K. Narayan Kumar, Milind Sohoni

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44618-4_37

Mathematics Subject Classification ID

Distributed systems (68M14) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Regular collections of message sequence charts (extended abstract)
• A theory of regular MSC languages
• On message sequence graphs and finitely generated regular MSC languages
• Infinite-state high-level MSCs: model-checking and realizability
• Synthesis of Safe Message-Passing Systems

Cited in

(13)

• Bounded MSC communication
• Realizability of high-level message sequence charts: closing the gaps
• Regular sets of infinite message sequence charts
• Infinite-state high-level MSCs: model-checking and realizability
• Message-passing automata are expressively equivalent to EMSO logic
• A theory of regular MSC languages
• The Synthesis Problem of Netcharts
• A quadratic construction for Zielonka automata with acyclic communication structure
• Regular collections of message sequence charts (extended abstract)
• Products of Message Sequence Charts
• Synthesis of Safe Message-Passing Systems
• Adding reconfiguration to Zielonka's asynchronous automata
• Pattern matching and membership for hierarchical message sequence charts

This page was built for publication: Synthesizing distributed finite-state systems from MSCs

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