Reiko Heckel, Hartmut Ehrig, Uwe Wolter, and Andrea Corradini. Integrating the Specification Techniques of Graph Transformation and Temporal Logic. In Igor Prvara and Peter Ruzicka, editors, Mathematical Foundations of Computer Science 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....formal verification of models (and modeling languages) defined by graph transformation systems has remained so far on a rather theoretical level. The theoretical basics of verifying open graph transformation systems by model checking techniques have already been studied thoroughly in, e.g. [17, 18] (and subsequent papers) A recent framework [3, 4] aims at to analyze infinite state graph transformation systems by static analysis (based on foldings and unfoldings of a special class of Petri nets) Rule invariants have been lately proposed in [27] in analogy with the notions of place ....

....be pointed out that in practical cases, the user is only interested in the correctness of his or her model and not the correctness of the entire modeling language. Moreover, proving the correctness of a property for all valid model instances is often impossible. As demonstrated by previously by [17, 18], graph transformation systems can be interpreted as a transition system where the state space is constituted from attributed graphs created by elementary graph transformation steps (see Fig. 5 for an overview) RuleApp1 RuleApp2 RuleApp2 RuleApp1 Fig. 5. The state space of graph ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. Mathematical Foundations of Computer Science (MFCS'97), Bratislava, vol. 1295 of LNCS, pp. 219--228. Springer, 1997.

....based temporal specifications are needed to be translated to traditional temporal logic formulae when inputting them into the SAL framework. 5. 1 Encoding of system states As the theoretical basics of model checking graph transformation systems have already been studied thoroughly in, e.g. [5, 6] (and subsequent papers) in the sequel, we concentrate on the same problem from a more practical point of view. We identify and discuss (up to our knowledge for the first time) the key issues in the automated integration of high level graph transformation based system specification techniques ....

....are correct, terminating, complete, and unique. The main contribution of the paper is the automated integration of model transformation systems with existing model checking based verification tools. We demonstrated that putting the theory of model checking graph transformation systems (such as [5, 6]) into practice (i.e. into a SAL specification) also requires a large number of sophisticated optimization steps to achieve an acceptable result. For an industrial strength case study, we formalized the semantics of UML Statecharts by means of model transition systems (see [15] which was ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. Mathematical Foundations of Computer Science (MFCS'97), Bratislava, vol. 1295 of LNCS, pp. 219--228. Springer, 1997.

....systems in a metamodeling (or UML) environment are highly prone to human errors, which necessitates an automated verification method for such systems. The theoretical basics of verifying graph transformation systems by model checking techniques have already been studied thoroughly in, e.g. [4,3] (and subsequent papers) however, no concrete implementation and tool support has been proposed that is capable of verifying formal specifications in the form of graph transformation systems in general. In the current paper, we propose (from a practical point of view) a model checking based ....

....able to investigate certain semantic properties of any specific well formed model instance of the language by various model checking based symbolic analysis techniques provided by the SAL environment. We demonstrated that putting the theory of model checking graph transformation systems (such as [4, 3]) into practice (e.g. into a SAL specification) also requires a large number of sophisticated optimization steps to achieve an acceptable run time result. For an industrial strength case study, we formalized the semantics of UML Statecharts by means of model transition systems (see [10] which ....

Heckel, R., H. Ehrig, U. Wolter and A. Corradini, Integrating the specification techniques of graph transformation and temporal logic, in: Proc. Mathematical Foundations of Computer Science (MFCS'97), Bratislava, LNCS 1295 (1997), pp. 219--228.

....Moreover, each system is associated with a category of models (deterministic transition systems) defined as coalgebras over a suitable functor. Such category has a final object, which includes all finite and infinite transition sequences. Building on these results, the aim of [HEWC97c] and [HEWC97b] is an extension of the theory of graph transformation systems in order to make them suitable for the specification of reactive systems. This is obtained by introducing constraints for graph transformation. The coalgebraic framework makes it possible to define a general notion of logic of ....

....a slightly more powerful generation mechanism than usual, namely finite copying top down tree transducers. Thus, finite copying compensates exactly the loss in power that results from allowing only hypertrees as righthand sides. Constraints for graph transformation are introduced in [HEWC97c] and [HEWC97b] in order to restrict the also in [HEWC97a] presented loose semantics of graph transformation systems. A coalgebraic framework makes it possible to define a general notion of logic of behavioural constraints. Instances include, for example, start graphs, application and consistency conditions, ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. of MFCS'97, Bratislava, volume 1295 of LNCS. Springer Verlag, 1997. 24

....in an invariant formula (5a 2b) states that this is true for all reachable markings from M . f3 f1 do3 do2 do1 u1 u2 d2 d1 f2 o2 dc2 dc3 o3 c1 c2 c3 dc1 o1 Figure1: Simple Elevator E 0 Note, that this use corresponds to the use of temporal logic in graph transformation (see [HEWC97]) where it is also used to describe the dynamics of a system. One criterion for the adequacy of the model is that the elevator can only move, if the doors are closed. This can be easily described for each floor by the temporal formula = don ) fn) that is the safety property The door in ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini, Integrating the Specification Techniques of Graph Transformation and Temporal Logic , Proc. MFCS'97,, Springer, LNCS 1295,, 1997.

No context found.

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. of MFCS'97, Bratislava, 1997.

....and coordination of complex behaviours, which is not yet sufficiently studied in the graph transformation context. Also, we would like to consider different kinds of constraints, like temporal logic formulas, in order to specify and verify important (e.g. safety critical) system properties (see [21]) Last but not least our view oriented technique must be supported by a specification language based on typed graph transformation systems and corresponding tools. A good candidate for this is PROGRES [14] where a related construction is already used for merging different versions of a document ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. of MFCS'97, Bratislava, 1997.

....include, for example, start graphs, application and consistency conditions, and temporal logic constraints. We show that the considered semantics can be restricted to a final coalgebra semantics for systems with behavioural constraints. Parts of the paper are submitted for publication as [HEWC97a,HEWC97b] 1 Introduction The theory of graph transformation systems basically studies a variety of formalisms which extend the theory of formal languages in order to deal with structures more general than strings, like graphs and maps. A graph transformation system allows one to describe finitely a ....

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. Submitted., 1997.

No context found.

Reiko Heckel, Hartmut Ehrig, Uwe Wolter, and Andrea Corradini. Integrating the Specification Techniques of Graph Transformation and Temporal Logic. In Igor Prvara and Peter Ruzicka, editors, Mathematical Foundations of Computer Science 1997.

No context found.

R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In I. Prvara and P. Ruzicka, editors, Mathematical Foundations of Computer Science 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