R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. In Proceedings of the 22nd International Conference on Software Engineering, pages 304--313. ACM Press, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... 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 appeared as one of the earliest abstract models for concurrent systems [5, 18] ....

....B ; A (t; B) Thus, we may write (s; B ; A (t; B) in this case. Finally, we say that A is deadlock free if for all states (s; B) 2 S such that (s 0 ; B ; A (s; B) we have (s; B) A (t; B ; for some (t; B ; 2 F. 3 Weak and safe realizability Let L M SC P;C . Following [1], we say that L is weakly realizable if there exists a CFM A over P and C such that msc(A) L. We say that L is safely realizable if there exists a deadlock free CFM A over P and C such that msc(A) L. These de nitions allow local automata with in nite state sets, but this case will never ....

[Article contains additional citation context not shown here]

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of the 22nd International Conference on on Software Engineering (ICSE 2000), Limerick (Ireland), pages 304-313. ACM Press, 2000.

....orthogonal state components. 1.2. Related work As far as the limited case of classical message sequence charts goes, there has been quite some work on synthesis from them. This includes the SCED method [18, 19] and synthesis in the framework of ROOM charts [22] Other relevant work appears in [28, 4, 2, 7, 16, 32, 23]. In addition, there is the work described in [21] which deals with LSCs, but synthesizes from a single chart only: an LSC is translated into a timed Buchi automaton (from which code can be derived) In addition to synthesis work directly from sequence diagrams of one kind or another, one should ....

Alur, R., K. Etessami and M. Yannakakis, "Inference of Message Sequence Charts", 2000.

....[5] The detection of possible failures in early design stages is of critical importance, and the utility of HMSCs can be greatly enhanced by automatic validation methods. A natural question for HMSC speci cations is to test whether the speci cation is implementable (or realizable) [2] Work partly supported by the European research project IST 1999 29082 ADVANCE and by the INRIA IRISA ARC project FISC. by a communication protocol and to construct such an implementation. Since an abstract communication protocol is usually described by communicating nitestate machines (CFM) ....

....message contents, while ruling out extra control messages. The reason is that additional messages mean additional process synchronization. This is not desirable, or even not realizable, in a given environment. Still, our implementation semantics by CFMs is more general than the one introduced in [2] and used in [3, 12] where a parallel product of nite state automata communicating 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 ....

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd Int. Conf. on Software Engineering, pages 304-313. ACM, 2000.

....while iterating during (unbounded) loops prevents such problems. Another direction of research strongly related to our work is synthesis, where the goal is to automatically synthesize a correct system implementation from the requirements. Work on synthesis from MSC like languages appears in [23, 24, 2, 34, 10], and an algorithm for synthesizing statecharts from LSC s appears in [13] Moreover, a lot of work has been done on synthesis from temporal logic e.g. 9, 1, 29, 25] The main difference is that in our work the play out algorithms search one super step ahead (or several super steps when ....

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Int. Conf. on Software Engineering (ICSE'00), Limerick, Ireland, June 2000.

....specification to avoid the undesired situation. In this paper, we present a framework for synthesising implementation models for scenario based specifications and for detecting the existence of and providing feedback on implied scenarios. Implied scenarios have been studied by Alur et al. [1] for a restricted scenario language. The issue of constructing an implementation and finding implied scenarios is limited to a set of message sequence charts (MSCs) that specify a finite set of (finite) system behaviours. We extend their work by providing a framework for a more expressive scenario ....

....LTSs for the example used in this paper, a slightly bigger version of it and a version of the ATM system (see e.g. 10] All examples were run on a Pentium Ill, 300Mhz, 256Mb with Windows NT 4.0 and Java 1.3. 7. RELATED WORK This work uses several of the concepts presented by Alur et al. in [1]. In particular we have used their notions of implied scenario and realisability, which we call implementability. The fundamental difference with this work is the scenario language being studied. In [1] only bMSCs are allowed, thus the issue of constructing an implementation and finding implied ....

[Article contains additional citation context not shown here]

Alur, R., Etessami, K. and Yannakakis, M., Inference of Message Sequence Charts. in 22nd International Conference on Software Engineering (ICSE'00), (Limerick, Ireland, 2000).

....of examples and counterexamples expressed as scenarios is used to infer a temporal logic specification. Thus, generating explicit declarative requirements from an operational description. Combining these requirements with LTS models may be an interesting possibility for future work. Alur et al. [21] give the semantics of bMSCs in terms of a partial order of events occurring in the whole system, as opposed to considering one component at a time. The focus is on characterizing and providing algorithms for checking satisfiability, and weak and strong realizability. As in our view, MSCs ....

Alur, R., K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. 22nd International Conference on Software Engineering. 2000, Limerick, Ireland.

....on E p for each p 2 P. Let b = S p2P p ) f(e; e 0 ) j e; e 0 2 E and (e) e 0 g. Let = b ) be the transitive closure of b . Then denotes the causal ordering of events in the MSC and we require it to be a partial order on E. non degeneracy) m is non degenerate ([AEY00]) in the sense that two identical messages sent by a process are not received in the reverse order: i.e. if there are events e 1 ; e 2 ; e 0 1 ; e 0 2 such that (e 1 ) e 2 ) p q; a) e 1 ) e 0 1 , e 2 ) e 0 2 and e 1 p e 2 , then it must be the case that e 0 1 q e 0 ....

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Intl. Conf. on Software Engg., pages 304-313, 2000.

....specification to avoid the undesired situation. In this paper, we present a framework for synthesising implementation models for scenario based specifications and for detecting the existence of and providing feedback on implied scenarios. Implied scenarios have been studied by Alur et al. [1] for a restricted scenario language. The issue of constructing an implementation and finding implied scenarios is limited to a set of message sequence charts (MSCs) that specify a finite set of (finite) system behaviours. We extend their work by providing a framework for a more expressive scenario ....

....LTSs for the example used in this paper, a slightly larger version of it and a version of the ATM system (see e.g. 10] All examples were run on a Pentium III, 300Mhz, 256Mb with Windows NT 4.0 and Java 1.3. 7. RELATED WORK This work uses several of the concepts presented by Alur et al. in [1]. In particular we have used their notions of implied scenario and realisability, which we call implementability. The fundamental difference with this work is the scenario language being studied. In [1] only bMSCs are allowed, thus the issue of constructing an implementation and finding implied ....

[Article contains additional citation context not shown here]

Alur, R., Etessami, K. and Yannakakis, M., Inference of Message Sequence Charts. 22nd International Conference on Software Engineering (ICSE'00). Limerick, Ireland, 2000.

....most frequently used formalism for designing communication protocols. Recently, they have been also used in the development of object oriented systems, e.g. in UML. In the recent years, we observe the development of a growing number of tools and algorithms for the manipulation of MSC based designs [1 3, 7, 11, 12]. The standard visual and textual notation [9] by ITU allows representing a single execution scenario, as well as a collection of scenarios, including choices and repetition. This is achieved by a notation called HMSC (High Level Message Sequence Chart) which consists of a graph, where each node ....

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of the 22nd Int. Conf. on Software Engineering, pp. 304--313, ACM, 2000.

....assumption in many cases, there are some 3 situations where non determinism is desirable. The formal semantic definition is given in terms of process algebra using non standard operators to model delayed choice. Other formalisations exist, both using delayed choice (e.g. 18, 19] and not (e.g. [20]) In terms of automated analysis of scenario based specifications there has not been so much work. Some approaches focus on detecting some consistency criteria (e.g. 9] which is done syntactically. Other approaches such as in [21] focus on checking specific properties such as process ....

Alur, R., K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. 22nd International Conference on Software Engineering (ICSE'00). 2000. Limerick, Ireland.

No context found.

R. Alur, K. Etessami, and M. Yannakakis, "Inference of message sequence charts," in Proceedings of 22nd International Conference on Software Engineering, pp. 304-- 313. 2000. 153

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of 22nd International Conference on Software Engineering, pages 304--313, 2000.

.... for more expressive MSC notations, such as MSCs annotated with state information (e.g. 16] and high level MSCs (as in, e.g. uBET [13] Acknowledgements Markus Lohrey, in [18] pointed out a bug in the characterization of safe realizability given in our conference version of this paper ([2]) Our modified characterization here, and our associated modification of the algorithm, correct this bug. Thanks to Markus for sending us a copy of his manuscript. This research was supported in part by NSF CAREER award CCR97 34115, NSF grant CCR99 70925, and NSF ITR award ITR SY01 21431. 26 ....

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of 22nd Int. Conf. on Software Engineering, pages 304--313, 2000.

....of processes [4] and linear in the size of the MSC graph. In this paper, we study a variety of analysis problems for bounded MSC graphs. The first analysis question studied in this paper concerns a form of consistency, called realizability, of specifications given as an MSC graph. As observed in [2], a set of MSCs can potentially imply other, distinct, MSCs whose communication pattern must be exhibited by any concurrent system that realizes the given MSCs. An MSC graph G is said to be realizable if there exists a distributed implementation whose behaviors are precisely the ones specified by ....

....that realizes the given MSCs. An MSC graph G is said to be realizable if there exists a distributed implementation whose behaviors are precisely the ones specified by G. The precise definition of realizability depends on the the underlying communication architecture for the distributed system [2]. In this paper we focus on realizability under a basic FIFO communication architecture. Unspecified, but implied, behaviors can be indicative of logical errors, and can be revealed by checking realizability. We prove that checking this form of realizability is, surprisingly, undecidable for ....

[Article contains additional citation context not shown here]

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of the 22nd International Conference on Software Engineering (ICSE), pages 304--313, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. In Proceedings of the 22nd International Conference on Software Engineering, pages 304--313. ACM Press, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd International Conference on Software Engineering. ACM, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. In Proceedings of the 22nd International Conference on Software Engineering. ACM, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. In Proceedings of the 22nd International Conference on Software Engineering. ACM, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd International Conference on Software Engineering. ACM, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. In proceedings of 22nd International Conference on Software Engineering, pages 304--313, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd International Conference on Software Engineering. ACM, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd International Conference on Software Engineering, 2000.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of 22nd International Conference on Software Engineering, 2000.

No context found.

R. Alur, K. Etessami, M. Yannakakis, Inference of message sequence charts, in: Proceedings of the 22nd International Conference on Software Engineering, 2000, pp. 304-- 313.

No context found.

R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts, 22nd International Conference on Software Engineering, 2000.

First 50 documents

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