F. Levi. Verification of Temporal and Real-time Properties of Statecharts. PhD thesis, Univ. of Pisa, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of statechart designs in software. Several semantics for statecharts have been proposed in the literature, for example the STATEMATE semantics proposed by Harel [44] compositional semantics by Uselton and Smolka[96] Pnueli and Shalev [81] and the approaches focused on verification by Levi [65],Mikk et al. 75] and Latella et al. 64] Most of these are concerned with defining the semantics of Harel s statecharts as presented in the STATEMATE tool. From our point of view, the work of [64] is interesting to compare with ours. There the authors discuss a formalization of UML state ....

F. Levi. Verification of Temporal and Real-Time Properties of Statecharts. PhD thesis, University of Pisa-Genoa-Udine, Pisa, Italy, 1997.

....built into the formal specification and validation framework, such as proof tactics within theorem provers, is immediately available to handle individual designs. Other formal semantics for immediate dialects of Statecharts have been either defined operationally in process algebraic settings [10, 12, 14, 20] or denotationally as in [8] However, more closely related to our approach is research conducted for the diagrammatic real time specification language Modecharts [9] and the textual reactive system specification language Esterel [2] Jahanian and Mok [9] gave a shallow embedding of Modecharts ....

F. Levi. Verification of Temporal and Real-time Properties of Statecharts. PhD thesis, Univ. of PisaGenova -Udine, Italy, February 1997.

....[Maraninchi 1992] causality is treated separately from compositionality and synchrony, while in (synchronous) statemate [Harel and Naamad 1996] the synchrony hypothesis is rejected. Other researchers achieved combining all three properties by storing complex semantic information via preorders [Levi 1997; Maggiolo Schettini et al. 1996; Uselton and Smolka 1994] or transition systems [Damm et al. 1997; Luttgen et al. 2000] However, no analysis of exactly how much information is needed to achieve compositionality has been made so far. This paper first illustrates the compositionality defect of ....

....oe b) oe c, which may be explored in the future. Our framework can also be employed for analyzing various other asynchronous Statecharts variants with global consistency. One example is the work of MaggioloSchettini et al. 1996] which is inspired by the process algebraic semantics presented by Levi [1997] and by Uselton and Smolka [1994] In their setting, and also in [Luttgen et al. 1999; 2000] the step construction procedure cannot fail since a transition is only considered to be enabled, if it is enabled in the sense of Pnueli and Shalev and if it does not produce any event that violates ....

[Article contains additional citation context not shown here]

Levi, F. 1997. Verification of temporal and real-time properties of Statecharts. Ph.D. thesis, Univ. of Pisa-Genova-Udine, Italy.

....in several software design notations including ROOM [31] STATEMATE [12] and UML [3] and commercial tools provide support for them. Nevertheless, precisely defining Statecharts semantics has proved extremely challenging, with a variety of proposals being offered in the literature [7, 10, 11, 16, 17, 18, 21, 22, 25, 27, 29, 30, 33]. Existing Statecharts variants typically conform to the following interpretation of system behavior. A Statechart may respond to an event entering the system by engaging in an enabled transition, thus performing a micro step. This transition may generate new events which, by causality, may in ....

....The first class adapts a process algebraic approach, where Statecharts languages are embedded in process algebras, for which structured operational semantics based on labeled transition systems are defined. Uselton and Smolka [34] have pioneered this approach which was then refined by Levi [18]. Their notion of transition system involves complex labels of the form hE; OEi, where E is a set of events and OE is a transitive, irreflexive order on 2 E encoding causality. The second class is characterized by following essentially the same ideas but avoiding the indirection of process ....

F. Levi. Verification of Temporal and Real-time Properties of Statecharts. PhD thesis, University of Pisa, 1997.

....states( n : s] fng [ S fstates(s i ) j 1 i kg trans( n] trans( n : s; l; T ] T [ S ftrans(s i ) j 1 i kg trans( n : s] S ftrans(s i ) j 1 i kg For our purposes, it is convenient to represent Statecharts not visually but by terms. This is also done in related work [16, 17, 24]; we closely follow [17] Formally, let N be a countable set of names for Statecharts states, T be a countable set of names for Statecharts transitions, and Pi be a countable set of Statecharts events. Moreover, we associate with every event e 2 Pi its negated counterpart :e. We also lift ....

....level the level of SPL action transitions whereas responsiveness and causality are guaranteed on the macrostep level the level where sequences of SPL action transitions between global synchronizations, caused by clock ticks oe, are bundled together. Uselton and Smolka [24, 25] and Levi [16] also focused on achieving a compositional semantics for Statecharts by referring to process algebras. In contrast to our approach, Uselton and Smolka s notion of transition system involves labels of the form hE; OEi, where E is a set of events, and OE is a transitive, irreflexive order on E ....

[Article contains additional citation context not shown here]

F. Levi. Verification of Temporal and Real-Time Properties of Statecharts. PhD thesis, University of Pisa-Genova-Udine, 1997.

....of the system to inputs is instantaneous . The instantaneous reaction of the system (a step) to inputs is given by a maximal set of parallel transitions triggered by the input. However, due to well known causality problems the formal definition of step is still quite controversial [10, 20, 17] [15, 16] show a translation of classical untimed statecharts into an untimed version of T SP which agrees with the approach of [20] where a step is required to satisfy some additional requirements of consistency and causality. The basic idea is to build a process with locations corresponding to the basic ....

....is necessary to take into account in basic actions also the causal relation between inputs and outputs. The operator of refinement allows us to naturally represent the statecharts hierarchy. The translation between statecharts and the process language can be extended to the timed discrete case [16]. However, the interest of the language is not limited to statecharts, since it can be instantiated to other process calculi with different communication mechanisms, such as Synchronous CCS [18] and the Calculus of Broadcasting Systems [21] by properly choosing the set of basic actions and the ....

[Article contains additional citation context not shown here]

F. Levi. Verification of Temporal and Real-Time Properties of Statecharts. PhD thesis, Dipartimento di Informatica, Universit`a di Pisa, 1997.

....redone. Moreover, compositional verfication permits to reason with partial specifications and can be applied during the process of specifications development. A compositional proof system in the style of [1] for checking whether an SP process satisfies a calculus formula has been developed in [9]. ....

F. Levi. Verification of Temporal and Real-Time Properties of Statecharts. PhD thesis, Dipartimento di Informatica, Universit`a di Pisa, 1997.

No context found.

F. Levi. Verification of Temporal and Real-time Properties of Statecharts. PhD thesis, Univ. of Pisa, 1997.

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