Handbook of theoretical computer science (vol. B)
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
Languages, automata, and logic
Handbook of formal languages, vol. 3
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Specification and Verification of Message Sequence Charts
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Reasoning about Message Passing in Finite State Environments
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Reasoning about Layered Message Passing Systems
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Generalised Regular MSC Languages
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Dynamic Message Sequence Charts
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
Compositional message sequence charts (CMSCs) are better to implement than MSCs
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Regular set of representatives for time-constrained MSC graphs
Information Processing Letters
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Propositional dynamic logic with converse and repeat for message-passing systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We study the model-checking problem for classes of message sequence charts (MSCs) defined by two extensions of message sequence graphs (MSGs). These classes subsume the class of regular MSC languages. We show that the model checking problem for these extended message sequence graphs against monadic second-order specifications is decidable. Moreover, we present two ways to model-check the extended classes -- one extends the proof for MSGs while the other extends the proof for regular MSC languages.