Skip to main content
SpringerLink
Log in

Modular System Development with Pullbacks

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2003 (ICATPN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2679))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. Bednarczyk, M. A.Categories of asynchronous systems. PhD Thesis, University of Sussex, 1–88, 1988.

    Google Scholar 

  3. 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.

    MATH  MathSciNet  Google Scholar 

  4. 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.

    Chapter  Google Scholar 

  5. Bernardinello, L. Synthesis of net systems. Proc. Application and Theory of Petri Nets, LNCS 691, pp.: 89–105, Springer-Verlag, 1993.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. Ehrenfeucht, A and G. Rozenberg. Partial (set) 2 structures, I & II. Acta Informatica, 27,4, pp.: 315–368, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  8. MacLane, S.Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer-Verlag, 1971.

    Google Scholar 

  9. Morin, R. Decompositions of asynchronous systems. In Proc. CONCUR’98, LNCS 1466, pp. 549–564. Springer, 1998.

    Google Scholar 

  10. Nielsen, M., Rozenberg, G. and P.S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96,1, pp.: 3–32, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  11. Nielsen, M., Rozenberg, G. and P.S. Thiagarajan. Elementary transition systems and refinement. Acta Informatica, 29, pp.: 555–578, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  12. Shields, M.Deterministic asynchronous automata. In E. J. Neuhold and G. Chroust (Eds.) Formal Methods in Programming, pp. 317–345, North-Holland, 1985.

    Google Scholar 

  13. Zielonka, W. Notes on finite asynchronous automata. RAIRO, Informatique Théoretique et Applications, vol. 21, pp.: 99–135, 1987.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPI PAN, Gdańsk, Poland

    Marek A. Bednarczyk & Wiesław Pawłowski

  2. DISCO, Università degli Studi di Milano-Bicocca, Milano, Italy

    Luca Bernardinello & Lucia Pomello

  3. IRISA, Rennes, France

    Benoît Caillaud

Authors
  1. Marek A. Bednarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Bernardinello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benoît Caillaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wiesław Pawłowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lucia Pomello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology and Management, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Wil M. P. van der Aalst

  2. Computer Science Department Parallel Systems Group, University of Oldenburg, 26111, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation