Communication and Concurrency
Software Testing Based on SDL Specifications with Save
IEEE Transactions on Software Engineering
First-Order Axioms for Asynchrony
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Using Roles with Types and Objects for Service Development
SMARTNET '99 Proceedings of the IFIP TC6 WG6.7 Fifth International Conference on Intelligence in Networks
Bisimulation analysis of SDL-expressed protocols: a case study
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
Using projections for the detection of anomalous behaviors
SDL'03 Proceedings of the 11th international conference on System design
ICT convergence: modeling issues
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Using UML 2.0 collaborations for compositional service specification
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
Specifying Service Composition Using UML 2.x and Composition Policies
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Automatic generation of compatible interfaces from partitioned UML activities
SDL'09 Proceedings of the 14th international SDL conference on Design for motes and mobiles
| Hi-index | 0.00 |
We use SDL and UML 2.0 state machines for behavior modeling of communication control software for telecommunication services. To ensure consistent designs we want to identify when a signal sent is not consumed and when a state machine waits indefinitely for a signal that never arrives. One approach to ensure such consistency is to derive interface contracts for each port from the properties of the state machine and use the contracts to check consistency. In this paper we describe how Calculus for Communicating Systems (CCS) [1] and stuck-free conformance [2] can be used as a formal fundament for this consistency checking. Interface descriptions should be comprehensible without having to learn process algebra. Therefore we introduce a graphical notation for both the port contracts and for the interaction made possible across the interface of two state machines.