Communicating sequential processes
Communicating sequential processes
Principles of software engineering management
Principles of software engineering management
Communication and concurrency
Targeting safety-related errors during software requirements analysis
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Generating statechart designs from scenarios
Proceedings of the 22nd international conference on Software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
An Algebraic Semantics for Message Sequence Chart Documents
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
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
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
From scenarios to code: an air traffic control case study
Proceedings of the 25th International Conference on Software Engineering
Synthesis of Open Reactive Systems from Scenario-Based Specifications
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Synthesizing Software Architecture Descriptions from Message Sequence Chart Specifications
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Testing of Concurrent Programs Based on Message Sequence Charts
PDSE '99 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Applying Design Metrics to a Large-Scale Software System
ISSRE '98 Proceedings of the The Ninth International Symposium on Software Reliability Engineering
Incremental elaboration of scenario-based specifications and behavior models using implied scenarios
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automatic generation of conformance tests from message sequence charts
SAM'02 Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC
Lazy buffer semantics for partial order scenarios
Automated Software Engineering
Thread---Based Analysis of Sequence Diagrams
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Models and Testing --- A Recipe for Improved Effectiveness?
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
Implementing MSC Tests with Quiescence Observation
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
A framework for pathologies of message sequence charts
Information and Software Technology
On the realizability of collaborative services
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper also proves the results can be generalized to a subclass of iterative scenarios.