Dynamic message sequence charts

DOI10.1007/3-540-36206-1_23MaRDI QIDQ4415260zbMATH OpenFDO

Authors Martin Leucker, Parthasarathy Madhusudan, Supratik Mukhopadhyay

Publication date 28 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560253.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) 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

• Beyond message sequence graphs
• The theory of message sequence charts
• Realizability of Dynamic MSC Languages
• A hierarchy of communication models for message sequence charts
• Reasoning about sequential and branching behaviours of message sequence graphs

Cited in

(12)

• An automaton over data words that captures EMSO logic
• Causal Message Sequence Charts
• Beyond message sequence graphs
• Reasoning about sequential and branching behaviours of message sequence graphs
• The theory of message sequence charts
• Dynamic communicating automata and branching high-level MSCs
• Foundations of Software Science and Computation Structures
• The pros and cons of netcharts
• Local Testing of Message Sequence Charts Is Difficult
• Propositional Dynamic Logic for Message-Passing Systems
• Message sequence charts
• Causal message sequence charts

This page was built for publication: Dynamic message sequence charts

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