Abstract
Two, seemingly different modular techniques for concurrent system development are investigated from a categorical perspective. A novel approach is presented in which they turn out to be merely special instances of pullback, a general categorical limit construction. Interestingly, the approach is based on truly concurrent semantics of systems.
Partially supported by CATALYSIS, a programme within CNRS/PAN cooperation framework, and by MIUR and CNR/PAN exchange programme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Badouel, E., and Ph. Darondeau. Dualities between nets and automata induced by schizophrenic objects. Proc. 6th Intnl. Conf. CTCS, LNCS 953, pp.: 24–43, Springer-Verlag, 1995.
Bednarczyk, M. A.Categories of asynchronous systems. PhD Thesis, University of Sussex, 1–88, 1988.
Bednarczyk, M. A, Borzyszkowski, A. M. and R. Somla. Finite completeness of categories of Petri nets. Fundamenta Informaticae, 43,1–4, pp.: 21–48, 2000.
Bednarczyk, M. A., and A. M. Borzyszkowski. On concurrent realization of reactive systems and their morphisms. H. Ehrig et al. (eds.) Unifying Petri Nets — Advances in Petri nets, LNCS 2128, pp.: 346–379, Springer-Verlag, 2001.
Bernardinello, L. Synthesis of net systems. Proc. Application and Theory of Petri Nets, LNCS 691, pp.: 89–105, Springer-Verlag, 1993.
Bernardinello, L, Ferigato, C and L. Pomello. Towards modular synthesis of EN systems. In B. Caillaud et al. (eds.) Synthesis and Control of Discrete Event Systems, 103–113, Kluwer Academic Publishers, 2002.
Ehrenfeucht, A and G. Rozenberg. Partial (set) 2 structures, I & II. Acta Informatica, 27,4, pp.: 315–368, 1990.
MacLane, S.Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer-Verlag, 1971.
Morin, R. Decompositions of asynchronous systems. In Proc. CONCUR’98, LNCS 1466, pp. 549–564. Springer, 1998.
Nielsen, M., Rozenberg, G. and P.S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96,1, pp.: 3–32, 1992.
Nielsen, M., Rozenberg, G. and P.S. Thiagarajan. Elementary transition systems and refinement. Acta Informatica, 29, pp.: 555–578, 1992.
Shields, M.Deterministic asynchronous automata. In E. J. Neuhold and G. Chroust (Eds.) Formal Methods in Programming, pp. 317–345, North-Holland, 1985.
Zielonka, W. Notes on finite asynchronous automata. RAIRO, Informatique Théoretique et Applications, vol. 21, pp.: 99–135, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bednarczyk, M.A., Bernardinello, L., Caillaud, B., Pawłowski, W., Pomello, L. (2003). Modular System Development with Pullbacks. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-44919-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40334-0
Online ISBN: 978-3-540-44919-5
eBook Packages: Springer Book Archive