Modeling concurrency with partial orders
International Journal of Parallel Programming
Design and validation of computer protocols
Design and validation of computer protocols
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
An Analyser for Mesage Sequence Charts
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Regular sets of infinite message sequence charts
Information and Computation
A theory of regular MSC languages
Information and Computation
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
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
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Causal message sequence charts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Realizability of dynamic MSC languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
A characterization of combined traces using labeled stratified order structures
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
A framework for pathologies of message sequence charts
Information and Software Technology
| Hi-index | 5.23 |
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade. The high expressive power of MSCs renders many basic problems concerning these languages undecidable. However, several of these problems are decidable for languages that possess a behavioral property called ''existentially bounded''. Unfortunately, collections of scenarios outside this class are frequently exhibited by systems such as sliding window protocols. We propose here an extension of MSCs called causal Message Sequence Charts and a natural mechanism for defining languages of causal MSCs called causal HMSCs (CaHMSCs). These languages preserve decidable properties without requiring existential bounds. Further, they can model collections of scenarios generated by sliding window protocols. We establish here the basic theory of CaHMSCs as well as the expressive power and complexity of decision procedures for various subclasses of CaHMSCs. We also illustrate the modeling power of our formalism with the help of a realistic example based on the TCP sliding window feature.