L. Helouet and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin (Germany), 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Safe Realizability of High-Level Message Sequence Charts - Lohrey (2002) (2 citations) (Correct)
.... possible to implement it as a communicating protocol (the implementation) which shows the same behaviour as the original HMSC This is a highly nontrivial problem, properties like for instance non local choices in HMSCs [4] may constitute nontrivial obstacles for obtaining realizations, see e.g. [10]. Concerning the formal de nition of realizability, we follow Alur et al. [1, 2] which de ne two notions of realizability: weak realizability and safe realizability. Both are based on the model of communicating nite state machines (CFMs) with FIFO queues for describing the implementation. CFMs ....
L. Helouet and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin (Germany), 2000.
Infinite-State High-Level MSCs: Model-Checking and.. - Genest, Muscholl.. (2002) (6 citations) (Correct)
....telecommunication applications it is of course essential to cope with unbounded communication bu ers. Globally cooperative HMSCs have been introduced independently in [12] whereas locally cooperative HMSCs are de ned in this paper. The local choice property we use here has been considered in [8]. In the rst part of the paper (Section 3) we consider the model checking problem and we show that it is decidable for globally cooperative HMSCs. The model checking problem is stated as intersection (negative property) or inclusion (positive property) of HMSCs, that is, the property to be ....
....over FIFO channels is employed to realize the (linear) behavior of each process of the given HMSC. Moreover, implementability in this framework is undecidable even for bounded HMSCs (however, deadlock free implementability is in EXPSPACE) Other notions of implementation are proposed in [7] [8], 13] We show that both HMSCs classes are always implementable by CFMs. Moreover, the CFM implementation of local choice HMSCs is deadlock free and of linear size. The proofs use standard techniques from Mazurkiewicz trace theory as well as speci c partial orders methods. Proofs are in most ....
[Article contains additional citation context not shown here]
L. Helouet and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th Int. Workshop on Formal Methods for Ind. Crit. Systems, 2000.
An Evaluation of Scenario Notations for Telecommunication.. - Amyot, Eberlein (2001) (6 citations) (Correct)
....MSCs, extended MSCs, HMSCs, LSCs, and UML interaction diagrams are especially common as source scenario models for construction approaches. Techniques based on HMSCs can further benefit from recent theoretical results on necessary conditions for the synthesis of communicating automata from HMSCs [33]. For target construction models, communicating finite state machines, whether they are hierarchical (ROOMCHARTS, UML) Statecharts, or OMT state diagrams) or not (SDL or plain CFSMs) are very common. It is difficult to determine the best construction approach for componentbased scenarios as they ....
Hlout, L. and Jard, C. "Conditions for synthesis of communicating automata from HMSCs". In: 5th International Workshop on Formal Methods for Industrial Critical Systems, Berlin, April 2000. http://www.fokus.gmd.de/research/cc/tip/fmics/abstracts/helouet.html Amyot and Eberlein p. 18
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC