Formal Tools for Modular System Development

  • Lucia Pomello
  • Luca Bernardinello
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3099)

Abstract

The dualities event–condition and local state–global state in basic net theory are exploited in order to equip system designers with formal tools supporting modular system development. In the framework of categories with suitable morphisms of Elementary Net systems, Elementary Transition systems and Orthomodular posets of system local states (regions), some operations of composition and refinement are discussed as tools for modularity and abstraction.

Keywords

Transition System State Transformation Observable Property Formal Tool Composition Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Badouel, E., Darondeau, P.: Theory of Regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)Google Scholar
  2. 2.
    Bednarczyk, M.A.: Categories of asynchronous systems. PhD Thesis, University of Sussex, pp. 1–88 (1988)Google Scholar
  3. 3.
    Bednarczyk, M.A., Bernardinello, L., Caillaud, B., Pawlowski, W., Pomello, L.: Modular System Development with Pullbacks. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 140–160. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Bernardinello, L.: Propriétés algébriques et combinatoires des régions dans les graphes, et leurs application à la synthèse de réseaux, PhD thesis, Université de Rennes I (1998)Google Scholar
  5. 5.
    Bernardinello, L., De Cindio, F.: A Survey of Basic Net Models and Modular Net Classes. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 304–351. Springer, Heidelberg (1992)Google Scholar
  6. 6.
    Bernardinello, L., Ferigato, C., Pomello, L.: Composing Net Systems by identification of conditions, DISCO Internal Report (2001), http://www.mcd.disco.unimib.it/pub/compcond.ps
  7. 7.
    Bernardinello, L., Ferigato, C., Pomello, L.: Towards modular synthesis of EN systems. In: Caillaud, B., et al. (eds.) Synthesis and Control of Discrete Event Systems, pp. 103–113. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  8. 8.
    Bernardinello, L., Ferigato, C., Pomello, L.: An Algebraic Model of Observable Properties in Distributed Systems. TCS 290, 637–668 (2003)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. In: EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (2001)Google Scholar
  10. 10.
    Brawer, W., Gold, R., Vogler, W.: Behaviour and equivalences Preserving Refinements of Petri Nets. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 1–46. Springer, Heidelberg (1991)Google Scholar
  11. 11.
    Castellano, L., De Michelis, G., Pomello, L.: Concurrency vs Interleaving: an instructive example. EATCS Bull. 31, 12–15 (1987)MATHGoogle Scholar
  12. 12.
    De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: Superposed Automata Nets. In: Reisig (ed.) Application and Theory of Petri Nets 1982. IFB, vol. 52, pp. 269–279. Springer, Heidelberg (1982)Google Scholar
  13. 13.
    De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: A State Transformation Equivalence for Concurrent Systems: Exhibited Functionality Equivalence. In: Vogt, F.H. (ed.) CONCURRENCY 1988. LNCS, vol. 335, pp. 222–236. Springer, Heidelberg (1988)Google Scholar
  14. 14.
    Desel, J., Merceron, A.: Vicinity Respecting Net Morphisms. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 165–185. Springer, Heidelberg (1990)Google Scholar
  15. 15.
    Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2 structures, I & II. Acta Informatica 27(4), 315–368 (1990)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Ferigato, C.: Note su alcune proprietá algebriche, logiche e topologiche della concorrenza. Ph.D. Thesis, Universitá degli Studi di Milano e Torino (1996)Google Scholar
  17. 17.
    Genrich, H.J., Lautenbach, K., Thiagarajan, P.S.: Elements of General Net Theory. In: Brauer, W. (ed.) Net Theory and Applications. LNCS, vol. 84, pp. 21–164. Springer, Heidelberg (1980)Google Scholar
  18. 18.
    Girault, C., Valk, R.: Petri Nets for Systems Engineering, A Guide to Modelling, verification, and applications. Springer, Heidelberg (2003)Google Scholar
  19. 19.
    van Glabbeck, R.: Comparative Concurrency Semantics and Refinement of Actions. PhD. Thesis, Centrum voor Wiskunde en Informatica, Amsterdam (1990)Google Scholar
  20. 20.
    Hoare, C.A.R.: Communicating Sequential Processes. Communication of the ACM 21(8), 666–671 (1978)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Meseguer, J., Montanari, U.: Petri Nets are Monoids. Information and Computation, vol. 88, pp. 105–155. Academic Press, London (1990)Google Scholar
  22. 22.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)Google Scholar
  23. 23.
    Milner, R.: Elements of Interaction, Turing Award Lecture. Communications of the ACM 36(1), 78–89 (1993)CrossRefGoogle Scholar
  24. 24.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theoretical Computer Science 96(1), 3–32 (1992)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems and refinement. Acta Informatica 29, 555–578 (1992)MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Petri, C.A.: Concepts of Net theory, Mathematical Foundations of Computer Science. In: Proc. Symp. and Summer School, High Tatras, pp. 137–146 (1973)Google Scholar
  27. 27.
    Pomello, L., Rozenberg, G., Simone, C.: A Survey of Equivalence Notions for Net Based Systems. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 410–472. Springer, Heidelberg (1992)Google Scholar
  28. 28.
    Pomello, L., Simone, C.: An Algebraic Characterization of Elementary Net System (Observable) State Space. Formal Aspects of Computing (1992) 4, 612–637 (1992)MATHCrossRefGoogle Scholar
  29. 29.
    Pták, P., Pulmannová, S.: Orthomodular Structures as Quantum Logics. Kluwer Academic Publishers, Dordrecht (1991)MATHGoogle Scholar
  30. 30.
    Rozenberg, G., Engelfriet, J.: Elementary Net Systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998)Google Scholar
  31. 31.
    Smith, E., Reisig, W.: The Semantics of a Net is a Net - an Exercise in General Net Theory. In: Voss, K., Genrich, H.J., Rosenberg, G. (eds.) Concurrency and Nets, pp. 461–479. Springer, Heidelberg (1987)Google Scholar
  32. 32.
    Winskel, G.: Petri Nets, Algebras, Morphisms and Compositionality. Inf. & Comput. 72(3), 197–238 (1987)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lucia Pomello
    • 1
  • Luca Bernardinello
    • 1
  1. 1.Dipartimento di InformaticaSistemistica e Comunicazione Università degli Studi di Milano - BicoccaMilanoItaly

Personalised recommendations