F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In Proc. of TAGT'98, pages 310-322. Springer, 2000. LNCS 1764. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Visual Modeling of Distributed Object Systems by Graph.. - Taentzer (2001) (2 citations) (Correct)
....framework, the results of this area can be used. A notion of consistency based on logical formulas on the existence and non existence of graph structures, and a constructive approach to ensure this consistency are presented in [8] Another approach to consistency checking has been followed in [7,11] by graph interpreted temporal logics. It is left to future work to extend these approaches to distributed graph transformation as it has been presented in this paper. 13 ....
F. Gadducci, R. Heckel, and M. Koch. A Fully Abstract Model for GraphInterpreted Temporal Logic. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Proc. 6th International Workshop on Theory and Application of Graph Transformation (TAGT'98), Springer LNCS 1764, pages 310 - 322, 2000.
GRAPHIT - Graphical Support and Integration of Formal.. - Ehrig, Bardohl.. (1999) (Correct)
.... was developed: true concurrency semantics for graph grammars [Kor95a, Kor95b, Rib96a, KR97b, Rib99] speci cation of dynamic abstract data types [ELO94] structuring and re nement of nets [Pad96] and graph grammars [HCEL96, Rib96a, Rib99, Hec98] and veri cation techniques for graph grammars [GHK98]. 4 GRAPHIT II Description and Workplan for 2000 and 2001 From the rst phase of the project, we have concluded that: Any speci cation language, as though powerful and exible it would be, will remain a thing for itself if it is heavily comprehended by humans. Two main components related to ....
....cations for graph grammars. Graph interpreted temporal logic has been introduced as a speci cation tool accompanying rule based graph transformation. It specializes propositional temporal logic by interpretation on transition systems where the states are graphs, so called graph transition systems [GHK98]. Re nement and structuring techniques for graph grammars and Petri nets shall be extended by assuming an open (i.e. incompletely speci ed) behavior of components. This supports compositionality of the speci cation and the veri cation of properties. Structuring techniques shall also take into ....
F. Gadducci, R. Heckel, and M. Koch. A Fully Abstract Model for GraphInterpreted Temporal Logic. submitted, 1998.
Appligraph: Applications of Graph Transformation - Third.. - Kreowski, (eds.) (2000) (Correct)
....particular, a Local Church Rosser Theorem and a weaker version of the Parallelism Theorem is proved. Conceptually, this allows us to represent both intra concurrency (within the speci ed subsystem) and inter concurrency (between subsystem and environment) 4.1. 3 Optimization and Correctness In [GHK00], graph interpreted temporal logic is an extension of propositional temporal logic for specifying graph transition systems (i.e. transition systems whose states are graphs) Recently, this logic was used for the speci cation and compositional veri cation of safety and liveness properties of ....
....systems whose states are graphs) Recently, this logic was used for the speci cation and compositional veri cation of safety and liveness properties of rule based graph transformation systems. However, no calculus or decision procedure for this logic was provided, which is the purpose of [GHK00]. First it is shown that any sound and complete deduction calculus for propositional temporal logic is also sound and complete when interpreted on graph transition systems, that is, they have the same discriminating power like general transition systems. Then, structural properties of the state ....
F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In Ehrig et al. [EEKR00].
Describing Policies with Graph Constraints and Rules - Manuel Koch And (2002) (1 citation) Self-citation (Koch) (Correct)
No context found.
F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In H. Ehrig, G. Engels, H.J. Kreowski, and G. Rozenberg, editors, Proc. of 6th Int. Workshop on Theory and Graph Transformation, number 1764 in LNCS. Springer, 2000.
Verifying Finite-State Graph Grammars: an Unfolding-Based.. - Baldan, Corradini, König (Correct)
No context found.
F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In Proc. of TAGT'98, pages 310-322. Springer, 2000. LNCS 1764.
Towerds Model Checking Graph Grammars - Arend Rensink Department (Correct)
No context found.
F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In H. Ehrig, G. Engels, H.-J. Kreowski, , and G. Rozenberg, editors, Proc. 6th Int. Workshop on Theory and Application of Graph Transformation, volume 1764 of Lecture Notes in Computer Science, pages 310--322. Springer-Verlag, 2000.
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