The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Systems Engineering Using SDL-92
Systems Engineering Using SDL-92
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Matching scenarios with timing constraints
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Checking coverage for infinite collections of timed scenarios
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We consider the problem of checking whether a distributed system described in SDL is consistent with a set of MSCs that constrain the interaction between the processes. In general, the MSC constraints may be both positive and negative. The system should execute all the positive scenarios "sensibly". On the other hand, the negative MSCs rule out some interactions as illegal. We would then like to verify that all the remaining legal interactions satisfy a desired global property, specified in linear-time temporal logic. We outline an approach to solve this problem using Spin, building in a modular way on existing tools.