Chandrasekaran, Prakash ; Mukund, Madhavan (2006) Matching scenarios with timing constraints In: 4th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2006, 25-27 Sep 2006, Paris, France.
Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F118673...
Related URL: http://dx.doi.org/10.1007/11867340_8
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| ID Code: | 114148 |
| Deposited On: | 25 May 2018 04:53 |
| Last Modified: | 25 May 2018 04:53 |
Repository Staff Only: item control page
