Abstract
Subobject transformation systems STS are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Church–Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baldan, P.: Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD dissertation, Department of Computer Science, University of Pisa, March. Available as technical report no. TD-1/00 (2000)
Baldan, P., Corradini, A., Heindel, T., König, B., Sobociński, P.: Processes for adhesive rewriting systems. In: Aceto, L., Ingólfsdóttir, A. (eds.) FoSSaCS, vol. 3921 of Lecture Notes in Computer Science, pp. 202–216. Springer Verlag (2006)
Baldan, P., Corradini, A., Montanari, U.: Concatenable graph processes: relating processes and derivation traces. In: Proc. of ICALP’98, vol. 1443 of Lecture Notes in Computer Science, pp. 283–295. Springer Verlag (1998)
Baldan, P., Corradini, A., Montanari, U.: Unfolding of double-pushout graph grammars is a coreflection. In: Ehrig, G., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Proceedings of the International Workshop on Theory and Application of Graph Transformations, vol. 1764 of Lecture Notes in Computer Science, pp. 145–163. Springer Verlag (1999)
Baldan, P., König, B., Stürmer, I.: Generating test cases for code generators by unfolding graph transformation systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT’04, vol. 3256 of Lecture Notes in Computer Science, pp. 194–209. Springer Verlag (2004)
Corradini, A., Heindel, T., Hermann, F., König, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT’06, vol. 4178 of Lecture Notes in Computer Science, pp. 30–45. Springer Verlag (2006)
Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fund. Inform. 26, 241–265 (1996)
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 [21], Chapter 3 (1997)
Danos, V., Krivine, J., Sobociński, P.: General reversibility. In: Express ’06, Electronic Notes in Theoretical Computer Science 175(3), pp. 75–86. Elsevier (2007)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer Verlag (2006)
Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation II: single pushout approach and comparison with double pushout approach. In: Rozenberg [21], Chapter 4 (1997)
Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inf. Control 57, 125–147 (1983)
Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Special issue of Fund. Inform. 26(3,4), 287–313 (1996)
Joyal, A., Street, R.: The geometry of tensor calculus. I. Adv. Math. 88, 55–112 (1991)
Kreowski, H.-J.: Manipulation von Graphmanipulationen. PhD thesis, Technische Universität Berlin (1977)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. Theor. Inf. Appl. 39(2), 511–546 (2005)
Leinster, T.: Higher Operads, Higher Categories. London Mathematical Lecture Notes. Cambridge University Press (2003)
Meseguer, J., Montanari, U.: Petri nets are monoids. Inform. and Comput. 88, 105–155 (1990)
Reisig, W.: Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag (1985)
Ribeiro, L.: Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin (1996)
Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific (1997)
Rozenberg, G., Engelfriet, J.: Elementary net systems. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models, vol. 1491 of Lecture Notes in Computer Science, pp. 12–121. Springer Verlag (1996)
Street, R.: Higher categories, strings, cubes and simplex equations. Appl. Categ. Structures. 3, 29–77 (1995)
Winskel, G.: Event structures. In: Petri Nets: Applications and Relationships to Other Models of Concurrency, vol. 255 of Lecture Notes in Computer Science, pp. 325–392. Springer Verlag (1987)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by EU IST-2004-16004 SEnSOria and MIUR PRIN 2005015824 ART. The third author acknowledges the support of EPSRC grant EP/D066565/1.
Rights and permissions
About this article
Cite this article
Corradini, A., Hermann, F. & Sobociński, P. Subobject Transformation Systems. Appl Categor Struct 16, 389–419 (2008). https://doi.org/10.1007/s10485-008-9127-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10485-008-9127-6