On Communicating Finite-State Machines
Journal of the ACM (JACM)
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
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
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
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
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Resolving Race Conditions in Asynchronous Partial Order Scenarios
IEEE Transactions on Software Engineering
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
Lazy buffer semantics for partial order scenarios
Automated Software Engineering
Detecting races in ensembles of message sequence charts
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
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
| Hi-index | 0.00 |
We study the notion of safe realizability for high-level message sequence charts (HMSCs), which was introduced in [2]. We prove that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of all HMSCs. This solves two open problems from [2]. Moreover we prove that safe realizability is also EXPSPACE complete for the larger class of transition-connected HMSCs.