Extending compositional message sequence graphs

DOI10.1007/3-540-36078-6_5MaRDI QIDQ4428292zbMATH OpenFDO

Authors Benedikt Bollig, Martin Leucker, Philipp Lucas

Publication date 15 September 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/2514/25140068.htm, https://repository.upenn.edu/cis_reports/171

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Network protocols (68M12) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Beyond message sequence graphs
• Compositional message sequence charts
• Reasoning about sequential and branching behaviours of message sequence graphs
• Regular collections of message sequence charts (extended abstract)
• A semantic and methodological essence of message sequence charts
• Message sequence graphs and decision problems on Marzurkiewicz traces
• On message sequence graphs and finitely generated regular MSC languages

Cited in

(3)

• Interpreting message flow graphs
• Beyond message sequence graphs
• Compositional message sequence charts (CMSCs) are better to implement than MSCs

This page was built for publication: Extending compositional message sequence graphs

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