Mukund, Madhavan ; Narayan Kumar, K. ; Thiagarajan, P. S. (2003) Netcharts: bridging the gap between HMSCs and executable specifications In: 14th International Conference on Concurrency Theory, 3-5 Sep 2003, Marseille, France.
Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F978-3-...
Related URL: http://dx.doi.org/10.1007/978-3-540-45187-7_20
Abstract
We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivial. Netcharts can describe all regular MSC languages (sets of MSCs in which channel capacities have a finite upper bound), unlike HMSCs, which can only describe finitely-generated regular MSC languages.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | Channel Capacity; Communication Graph; Message Type; Input Place; Message Sequence Chart |
| ID Code: | 114206 |
| Deposited On: | 25 May 2018 04:57 |
| Last Modified: | 25 May 2018 04:57 |
Repository Staff Only: item control page
