Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
The Unified Modeling Language user guide
The Unified Modeling Language user guide
The Book of Traces
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Verification of Message Sequence Charts via Template Matching
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Smart Play-out of Behavioral Requirements
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Modelling with Partial Orders - Why and Why Not?
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
From Finite State Communication Protocols to High-Level Message Sequence Charts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Realizability and Verification of MSC Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Embedded Systems: Challenges in Specification and Verification
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
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
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
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
Smart Play-Out Extended: Time and Forbidden Elements
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
Mining message sequence graphs
Proceedings of the 33rd International Conference on 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
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
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A framework for pathologies of message sequence charts
Information and Software Technology
| Hi-index | 0.00 |
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. A standard method to describe multiple communication scenarios is to use message sequence graphs (MSGs). A message sequence graph allows the protocol designer to write a finite specification which combines MSCs using basic operations such as branching choice, composition and iteration. The MSC languages described by MSGs are not necessarily regular in the sense of [HM+99]. We characterize here the class of regular MSC languages that are MSG-definable in terms of a notion called finitely generated MSC languages. We show that a regular MSC language is MSG-definable if and only if it is finitely generated. In fact we show that the subclass of "bounded" MSGs defined in [AY99] exactly capture the class of finitely generated regular MSC languages.