A. C. Uselton, S. A. Smolka. State refinement in process algebra. In proceedings of the North American Process Algebra Workshop. New York, August 1993. 38 Y.WANG, J-P.TALPIN, A.BENVENISTE, P.LEGUERNIC  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and deployment can be easily applied to the system. Since the definition of Statechart [3] numerous contributions have been devoted to providing a semantics for this formalism. Some use automata or hierarchical automata [6] graph expansion [2] labeled transition system [11] process algebras [10]. However, most of these proposals usually study an abstract sub set of Statecharts. For instance, most proposals do not take the notion of history into consideration, or do not consider join, fork connectors. In most cases, available models only 4 Y.WANG, J P.TALPIN, A.BENVENISTE, P.LEGUERNIC ....

A. C. Uselton, S. A. Smolka. State refinement in process algebra. In proceedings of the North American Process Algebra Workshop. New York, August 1993. 38 Y.WANG, J-P.TALPIN, A.BENVENISTE, P.LEGUERNIC

....and deployment can be easily applied to the system. Since the definition of STATE CHART [3] numerous contributions have been devoted to providing a semantics for this formalism. Some use automata or hierarchical automata [6] graph expansion [2] labeled transition system [11] process algebras [10]. However, most of these proposals usually study an abstract sub set of STATECHARTs. For instance, most proposals do not take the notion of history into consideration, or do not consider join, fork connectors. In most cases, available models only consider transitions which have one source state ....

A. C. Uselton, S. A. Smolka. State refinement in process algebra. In proceedings of the North American Process Algebra Workshop. New York, August 1993.

....the display of the Stabilizer Position Indicator (SPI) that is being installed in the cockpits of Boeing 777 aircraft. To handle the SPI and other intended applications, we are extending the Factory s user interface and analysis techniques to handle real time specifications. State Refinement. In [US93, US94b, US94a] we introduced a new process algebraic operator that allows one process to be embedded in the state of another process. State refinement captures the key ideas of hierarchy and concurrency indigenous to Statecharts [Har87] the end result is that system specifications are often ....

A. C. Uselton and S. A. Smolka. State refinement in process algebra. In Proc. Second North American Workshop on Process Algebra, NAPAW '93, Ithaca, NY, August 1993.

.... statecharts a semantics based on graph rewriting [13] In this paper we put forth a process algebraic semantics for statecharts agreeing with [19] In particular, we provide a translation of statecharts into a process algebra with state refinement , a new operator introduced by the authors in [22]. The semantics of a statechart is then given by the labeled transition system (LTS) of its translation, as defined by the process algebra s structural operational semantics (SOS) The benefits to be reaped by giving statecharts a process algebraic semantics include the following: Simplicity ....

....LTSs are isomorphic. For this notion of equality we have the following identities: x 1 x 2 j SPA x 2 x 1 x 1 (x 2 x 3 ) j SPA (x 1 x 2 ) x 3 x 1 x 2 j SPA x 2 x 1 x 1 (x 2 x 3 ) j SPA (x 1 x 2 ) x 3 For a more detailed treatment of the axiomatization of SPA i we refer the reader to [22]. In the following we will use P 1in t i for any parenthesization of t 1 Delta Delta Delta t n and similarly Q 1in t i = t 1 Delta Delta Delta t n . 274 P refix l Delta x l Gamma x Sum 1 x 1 l Gamma y 1 x 1 x 2 l Gamma y 1 x 2 l Gamma y 2 x 1 x 2 l Gamma ....

A. C. Uselton and S. A. Smolka. State refinement in process algebra. In Proceedings of the North American Process Algebra Workshop, Ithaca, New York, August 1993. Available as TR 93-1369, Department of Computer Science, Cornell University.

....semantics; show that the statecharts process algebra SPA corresponds to the algebra SA; and finally give a sound and (relatively) complete axiomatization of SPA. The present paper achieves the first of these objectives, and [US94] achieves the second. The third objective is partly achieved in [US93] and an extended version of that paper is in preparation. ....

A. C. Uselton and S. A. Smolka. State refinement in process algebra. In Proceedings of the North American Process Algebra Workshop, Ithaca, New York, August 1993. Available as TR 93-1369, Department of Computer Science, Cornell University.

....term containing it. 6. 2 Statecharts Process Algebra In [US94b] we showed that a traditional process algebra with prefix, choice, and recursion, need only be extended with the appropriate variant of merge (capturing statecharts like broadcast communication) and a new state refinement operator [US93] in order to produce a statecharts like process algebra, SPA. This improves upon the algebra SA in two ways. First, in SA there is a term configuration dichotomy not found in process algebras. In SPA a term is a state simplifying the presentation of the semantics. Second, there is a wealth ....

A. C. Uselton and S. A. Smolka. State refinement in process algebra. In Proceedings of the North American Process Algebra Workshop, Ithaca, New York, August 1993. Available as TR 93-1369, Department of Computer Science, Cornell University.

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