Beyond message sequence graphs

DOI10.1007/3-540-45294-X_22MaRDI QIDQ4474224zbMATH OpenFDO

Authors Parthasarathy Madhusudan, B. Meenakshi

Publication date 4 August 2004

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/2245/22450256.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reasoning about sequential and branching behaviours of message sequence graphs
• Dynamic message sequence charts
• Extending compositional message sequence graphs
• On message sequence graphs and finitely generated regular MSC languages
• The theory of message sequence charts

Cited in

(16)

• Bounded MSC communication
• Regular sets of infinite message sequence charts
• Interpreting message flow graphs
• 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
• Quantitative analysis of communication scenarios
• Regular set of representatives for time-constrained MSC graphs
• Dynamic message sequence charts
• Extending compositional message sequence graphs
• Realizability and verification of MSC graphs
• Reasoning about sequential and branching behaviours of message sequence graphs
• Message sequence graphs and decision problems on Marzurkiewicz traces
• Hyper partial order logic
• Propositional Dynamic Logic for Message-Passing Systems
• Synthesis and Analysis of Petri Nets from Causal Specifications

This page was built for publication: Beyond message sequence graphs

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