Compositional message sequence charts (CMSCs) are better to implement than MSCs

DOI10.1007/978-3-540-31980-1_28MaRDI QIDQ5703776zbMATH OpenOpenAlexFDO

Authors Blaise Genest

Publication date 10 November 2005

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

Full work available at URL https://doi.org/10.1007/b107194

Mathematics Subject Classification ID

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

• Compositional message sequence charts
• A hierarchy of communication models for message sequence charts
• Infinite-state high-level MSCs: model-checking and realizability
• Realizability and verification of MSC graphs
• Extending compositional message sequence graphs

Cited in

(2)

• Realizability Criteria for Compositional MSC
• Non-local choice and beyond: intricacies of MSC choice nodes

This page was built for publication: Compositional message sequence charts (CMSCs) are better to implement than MSCs

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