Computer networks
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Introduction to algorithms
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Specification Diagrams for Actor Systems
Higher-Order and Symbolic Computation
Extending Compositional Message Sequence Graphs
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Smart Play-out of Behavioral Requirements
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
From Finite State Communication Protocols to High-Level Message Sequence Charts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Reasoning about Layered Message Passing Systems
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Generalised Regular MSC Languages
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Formal hardware specification languages for protocol compliance verification
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Smart Play-Out Extended: Time and Forbidden Elements
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Resolving Race Conditions in Asynchronous Partial Order Scenarios
IEEE Transactions on Software Engineering
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Triggered Message Sequence Charts
IEEE Transactions on Software Engineering
Causal Message Sequence Charts
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Products of message sequence charts
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Inherent causal orderings of partial order scenarios
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Non-local choice and beyond: intricacies of MSC choice nodes
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Temporal logic for scenario-based specifications
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Realizability criteria for compositional MSC
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
MSCAN: a tool for analyzing MSC specifications
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reasoning about layered message passing systems
Computer Languages, Systems and Structures
Causal message sequence charts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying infinite scenarios and different choices. Specifically, an HMSC consists of a graph, where each node is a finite MSC with matched send and receive events, and vice versa. In this paper we demonstrate a weakness of HMSCs, which disallows one to model certain interactions. We will show, by means of an example, that some simple finite state and simple communication protocol cannot be represented using HMSCs. We then propose an extension to the MSC standard, which allows HMSC nodes to include unmatched messages. The corresponding graph notation will be called HCMSC, which stands for High level Compositional Message Sequence Charts. With the extended framework, we provide an algorithm for automatically constructing an MSC representation for finite state asynchronous message passing protocols.