Abstract
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the abstract setting of (single pushout) rewriting over adhesive categories. The unfolding construction is characterized as a coreflection, i.e. the unfolding functor arises as the right adjoint to the embedding of the category of occurrence grammars into the category of grammars.
As the unfolding represents potentially infinite computations, we need to work in adhesive categories with “well-behaved” colimits of ω-chains of mono-morphisms. Compared to previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism.
Supported by DFG project SANDS and project AVIAMO of the University of Padova.
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
Baldan, P.: Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars. PhD thesis, Dipartimento di Informatica, Università di Pisa (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 2006. LNCS, vol. 3921, pp. 202–216. Springer, Heidelberg (2006)
Baldan, P., Corradini, A., König, B.: A framework for the verification of infinite-state graph transformation systems. Information and Computation 206, 869–907 (2008)
Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Unfolding Semantics of Graph Transformation. Information and Computation 205, 733–782 (2007)
Baldan, P., Chatain, T., Haar, S., König, B.: Unfolding-based diagnosis of systems with an evolving topology. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 203–217. Springer, Heidelberg (2008)
Benveniste, A., Fabre, E., Haar, S., Jard, C.: Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Transactions on Automatic Control 48(5), 714–727 (2003)
Birkhoff, G.: Lattice Theory. American Mathematical Society (1967)
Cockett, R., Guo, X.: Join restriction categories and the importance of being adhesive. Unpublished manuscript, slides from CT 2007 (2007), http://pages.cpsc.ucalgary.ca/~robin/talks/jrCat.pdf
Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and Concurrency in High-Level Replacement Systems. Mathematical Structures in Computer Science 1, 361–404 (1991)
Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: Proc. of IEEE Conf. on Automata and Switching Theory, pp. 167–180 (1973)
Hayman, J., Winskel, G.: The unfolding of general Petri nets. In: Proc. of FSTTCS 2008. Dagstuhl Seminar Proceedings, vol. (08004) (2008)
Heindel, T., Sobociński, P.: Van Kampen colimits as bicolimits in Span. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 335–349. Springer, Heidelberg (2009)
Johnstone, P.T.: Sketches of an Elephant, vol. 1. Oxford Science Publications (2002)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39(2), 511–546 (2005)
Lack, S., Sobociński, P.: Toposes are adhesive. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 184–198. Springer, Heidelberg (2006)
Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 181–224 (1993)
McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Place/Transition Petri nets. Mathematical Structures in Computer Science 7(4), 359–397 (1997)
Robinson, E., Rosolini, G.: Categories of partial maps. Inf. Comput. 79(2), 95–130 (1988)
Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldan, P., Corradini, A., Heindel, T., König, B., Sobociński, P. (2009). Unfolding Grammars in Adhesive Categories. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)