IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A theory of regular MSC languages
Information and Computation
Checking consistency of SDL+MSC specifications
SPIN'03 Proceedings of the 10th international conference on Model checking software
Communicating timed automata: the more synchronous, the more difficult to verify
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
An evaluation of timed scenario notations
Journal of Systems and Software
Automata and logics for timed message sequence charts
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Checking coverage for infinite collections of timed scenarios
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
Reachability of communicating timed processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design
| Hi-index | 0.00 |
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are “consistent” with those provided in a timed MSC specification. In general, the specification may be both positive and negative. The system should execute all positive scenarios “sensibly”. On the other hand, negative scenarios rule out some behaviours as illegal. This is more complicated than the corresponding problem in the untimed case because even a single timed MSC specification implicitly describes an infinite family of timed scenarios. We outline an approach to solve this problem that can be automated using Uppaal.