Membership problems for regular and context-free trace languages
Information and Computation
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
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)
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
MESA: Support for Scenario-Based Design of Concurrent Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for 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
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th 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
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Calculus of Global Interaction based on Session Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Translating Message Sequence Charts to other Process Languages Using Process Mining
Transactions on Petri Nets and Other Models of Concurrency I
Replaying play in and play out: synthesis of design models from scenarios by learning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Strong safe realizability of message sequence chart specifications
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Quantifying the discord: order discrepancies in message sequence charts
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Synthesis of safe message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Semantics of UML models for dynamic behavior: a survey of different approaches
MBEERTS'07 Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems
A distributed framework for reliable and efficient service choreographies
Proceedings of the 20th international conference on World wide web
NIÑOS take five: the management infrastructure for distributed event-driven workflows
Proceedings of the 5th ACM international conference on Distributed event-based system
Analyzing realizability of choreographies using initiating and responding flows
Proceedings of the 8th International Workshop on Model-Driven Engineering, Verification and Validation
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Realizability of dynamic MSC languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
FM'06 Proceedings of the 14th international conference on Formal Methods
Realizability criteria for compositional MSC
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Structured Communication-Centered Programming for Web Services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Checking the realizability of BPMN 2.0 choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A framework for pathologies of message sequence charts
Information and Software Technology
Local testing of message sequence charts is difficult
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Counterexample guided synthesis of monitors for realizability enforcement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On the realizability of collaborative services
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Scenario-based specifications such as message sequence charts (MSC) offer an intuitive and visual way to describe design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are undecidable for MSC-graphs in general, but are known to be decidable for the class of bounded MSC-graphs.Our first set of results concerns checking realizability of bounded MSC-graphs. An MSC-graph is realizable if there is a distributed implementation that generates precisely the behaviors in the graph. There are two notions of realizability, weak and safe, depending on whether or not we require the implementation to be deadlock-free. It is known that for a finite set of MSCs, weak realizability is coNP-complete while safe realizability has a polynomial-time solution. We establish that for bounded MSC-graphs, weak realizability is, surprisingly, undecidable, while safe realizability is in EXPSPACE.Our second set of results concerns verification of MSC-graphs. While checking properties of a graph G, besides verifying all the scenarios in the set L(G) of MSCs specified by G, it is desirable to verify all the scenarios in the set Lw(G)--the closure of G, that contains the implied scenarios that any distributed implementation of G must include. For checking whether a given MSC M is a possible behavior, checking M ∈ L(G) is NP-complete, but checking M ∈ Lw(G) has a quadratic solution. For temporal logic specifications, considering the closure makes the verification problem harder: while checking LTL properties of L(G) is PSPACE-complete for bounded graphs G, checking even simple "local" properties of Lw(G) is undecidable.