From finite state communication protocols to high-level message sequence charts

DOI10.1007/3-540-48224-5_59MaRDI QIDQ4535059zbMATH OpenFDO

Authors Anca Muscholl, Doron Peled

Publication date 12 June 2002

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/2076/20760720

zbMATH Keywords

bounded automataHMSCmessage sequence chartspartial order specificationspecification

Mathematics Subject Classification ID

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

• Infinite-state high-level MSCs: model-checking and realizability
• Compositional message sequence charts
• scientific article; zbMATH DE number 2087438
• Bounded MSC communication
• scientific article; zbMATH DE number 2086413

Cited in

(6)

• 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
• Compositional message sequence charts
• scientific article; zbMATH DE number 2086660 (Why is no real title available?)
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

This page was built for publication: From finite state communication protocols to high-level message sequence charts

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