Abstract
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is the ability to express this kind of interaction. Classical rule-based approaches like Petri nets and graph transformation are not suited for this purpose because they assume to have complete control about the state and its transformation. Therefore, in this paper we propose a general framework which extends a given rule-based approach by a loose semantics where the rules of the system (e.g., graph productions or Petri net transitions) are considered as incomplete descriptions of the transformations to be performed: they still determine the changes to the matched substructure but for the remaining part (the context) unspecified changes are possible representing the application of (unknown) rules from the environment.
The framework is applied to graph transformation systems in the double-pushout approach as well as place-transition Petri nets leading, respectively, to the concepts of graph transition and open step.
Research partially supported by the German Research Council (DFG), the Spanish DGES project PB96-0191-CO2, the TMR network GETGRATS, and the ESPRIT Basic Research Working Group APPLIGRAPH
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bauderon, M.: A category-theoretical approach to vertex replacement: The generation of infinite graphs. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 27–37. Springer, Heidelberg (1996)
Bauderon, M., Jacquet, H.: Categorical product as a generic graph rewriting mechanism. Applied Categorical Structures (1999); To appear. Also Tech. Rep. 1166-97, University of Bordeaux
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach. In: Rozenberg [15], pp. 163–245
Ehrig, H., Heckel, R., Llabres, M., Orejas, F.: Basic properties of double pullback graph transitions. Technical Report 99-02, TU Berlin (1999)
Ehrig, H., Heckel, R., Padberg, J., Rozenberg, G.: Graph transformation and other rule-based formalisms with incomplete information. In: Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT 1998), Paderborn (1998)
Ehrig, H., Merten, A., Padberg, J.: How to transfer concepts of abstract data types to petri nets? EATCS Bulletin 62, 106–114 (1997)
Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg [15], pp. 1–94
Engels, G., Heckel, R., Taentzer, G., Ehrig, H.: A combined reference modeland view-based approach to system specification. Int. Journal of Software and Knowledge Engeneering 7(4), 457–477 (1997)
Heckel, R.: Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, TU Berlin (1998)
Heckel, R., Ehrig, H., Wolter, U., Corradini, A.: Double-pullback transitions and coalgebraic loose semantics for graph transformation systems. Applied Categorical Structures (1999); To appear, see also TR 97-07 at http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html
Janhsen, A., Lemmer, K., Ptok, B., Schnieder, E.: Formal specifications of the european train control system. In: IFAC Transportation Systems, 8th Symposium on Transportation Systems (1997)
Löwe, M.: Algebraic approach to single-pushout graph transformation. TCS 109, 181–224 (1993)
Meseguer, J., Montanari, U.: Petri nets are monoids. Information and Computation 88(2), 105–155 (1990)
Padberg, J., Jansen, L., Heckel, R., Ehrig, H.: Interoperability in train control systems: Specification of scenarios using open nets. In: Proc. Integrated Design and Process Technology (IDPT 1998), Berlin (1998)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, Singapore (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrig, H., Heckel, R., Llabrés, M., Orejas, F., Padberg, J., Rozenberg, G. (2000). Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-46464-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67203-6
Online ISBN: 978-3-540-46464-8
eBook Packages: Springer Book Archive