Skip to main content
SpringerLink
Log in

Algebra of Networks

Modeling simple networks, as well as complex interactive systems

  • Chapter
Proof and System-Reliability

Part of the book series: NATO Science Series ((NAII,volume 62))

Abstract

The first part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces finite interactive systems as an abstract mathematical model of agents’ behaviour and their interaction.

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

Access this chapter

Log in via an institution
eBook
USD 16.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.

References

  1. Arnold, A. (1994). Finite transition systems. Prentice-Hall International.

    Google Scholar 

  2. Baeten, J.C.M. and Weijland, W.P. (1990). Process Algebra. Cambridge University Press.

    Book  Google Scholar 

  3. Bloom, S.L. and Esik, Z. (1993). Iteration Theories: The Equational Logic of Iterative Processes. Springer-Verlag.

    Google Scholar 

  4. Booch, G., Rumbaugh, J., anf Jacobson, I. (1999) The Unified Modeling Language User Guide. Addison Wesley.

    Google Scholar 

  5. Broy, M. and Stefanescu, G. (2001). The algebra of stream processing functions. Theoretical Computer Science, 258, 95–125.

    Article  MathSciNet  Google Scholar 

  6. Bruni, R. (1999). Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Universita di Pisa. Report TD-1/99.

    Google Scholar 

  7. Bruni, R. and Montanari, U. (1997). Zero-safe nets, or transition synchronization made simple. Electronic Notes in Theoretical Computer Science, vol. 7(20 pages).

    Article  MathSciNet  Google Scholar 

  8. Cardeli, L. and Gordon, A. (2000). Anytime, anywhere: modal logics for mobile ambients. In: POPL-2000, Symposium on Principles of Programming Languages, Boston, 2000. ACM Press.

    Google Scholar 

  9. Cazanescu, V.E. and Stefanescu, G. (1990). Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13, 171–210.

    MathSciNet  MATH  Google Scholar 

  10. Cazanescu, V.E. and Stefanescu, G. (1994). Feedback, iteration and repetition. In Gh. Păun, editor, Mathematical aspects of natural and formal languages, pages 43–62. World Scientific, Singapore.

    Google Scholar 

  11. Conway, J.H. (1971). Regular Algebra and Finite Machines. Chapman and Hall.

    Google Scholar 

  12. Elgot, C.C. (1975). Monadic computation and iterative algebraic theories. In H.E. Rose and J.C. Sheperdson, editors, Proceedings of Logic Colloquium ’73, volume 80 of Studies in Logic and the Foundations of Mathematics, pages 175–230. North-Holland.

    Google Scholar 

  13. Gadducci, F. and Montanari, U. (1996). The tile model. In Papers dedicated to R. Milner festschrift. The MIT Press, Cambridge, to appear, 1999. Also: Technical Report TR–96-27, Department of Computer Science, University of Pisa.

    Google Scholar 

  14. Garg, V. and Ragunath, M.T. (1992). Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science, 96, 285–304.

    Article  MathSciNet  MATH  Google Scholar 

  15. Giammarresi, D. and Restivo A. (1997). Two-dimensional languages. In G. Rozen-berg and A. Salomaa, editors, Handbook of formal languages. Vol. 3: Beyond words, pages 215–265. Springer-Verlag.

    Chapter  Google Scholar 

  16. Giammarresi, D., Restivo, A., Seibert, S., and Thomas W. (1996). Monadic second order logic over rectangular pictures and recognizability by tiling systems. Information and Computation, 125, 32–45.

    Article  MathSciNet  MATH  Google Scholar 

  17. Grosu, R., Lucanu, D., and Stefanescu G. (2000). Mixed relations as enriched semiringal categories.Journal of Universal Computer Science, 6(1), 112–129.

    MathSciNet  MATH  Google Scholar 

  18. Grosu, R., Stefanescu, G., and Broy, M. (1998). Visual formalism revised. In Proceeding of the CSD ’98 (International Conference on Application of Concurrency to System Design, March 23–26, 1998, Fukushima, Japan), pages 41–51. IEEE Computer Society Press.

    Chapter  Google Scholar 

  19. Hennessy, M. (1988). Algebraic theory of processes. Foundations of Computing. The MIT Press, Cambridge.

    Google Scholar 

  20. Inoue, K. and Takanami, I. (1991). A survey of two-dimensional automata theory. Information Sciences, 55, 99–121.

    Article  MathSciNet  MATH  Google Scholar 

  21. Joyal, A., Street, R., and Verity, D. (1996). Traced monoidal categories. Proceedings of the Cambridge Philosophical Society, 119, 447–468.

    Article  MathSciNet  MATH  Google Scholar 

  22. Kari, J. and Moore, C. (2000). New results on alternating and non-deterministic two-dimensional finite-state automata. In: Proceedings STACS 2001, LNCS 2010, 396–406, Springer-Verlag.

    Google Scholar 

  23. Kleene, S.C. (1956). Representation of events in nerve nets and finite automata. In: C.E. Shannon and J. McCarthy, eds., Automata Studies, Annals of Mathematical Studies, vol. 34, 3–41. Princeton University Press.

    Google Scholar 

  24. Lindgren, K., Moore, C., and Nordahl, M. (1998). Complexity of two-dimensional patterns. Journal of Statistical Physics 91, 909–951.

    Article  MathSciNet  MATH  Google Scholar 

  25. Latteux, M. and Simplot, D. (1997). Recognizable picture languages and domino tiling. Theoretical Computer Science 178, 275–283.

    Article  MathSciNet  MATH  Google Scholar 

  26. Manes, E.G. and Arbib, M.A. (1986). Algebraic approaches to program semantics. Springer-Verlag.

    Book  Google Scholar 

  27. Matz, 0. (1997). Regular expressions and context-free grammars for picture languages. In: Proceedings STACS’97, LNCS 1200, 283–294, Springer-Verlag.

    Google Scholar 

  28. Meseguer, J. and Montanari, U. (1990). Petri nets are monoids. Information and Computation, 88, 105–155.

    Article  MathSciNet  MATH  Google Scholar 

  29. Milner R. (1989). Communication and concurrency. Prentice-Hall International.

    Google Scholar 

  30. Petri, C.A. (1962). Kommunikation mit Automaten. PhD thesis, Institute für Instrumentelle Mathematik, Bonn, Germany.

    Google Scholar 

  31. Stefanescu, G. (1987). On flowchart theories: Part I. The deterministic case. Journal of Computer and System Sciences, 35, 163–191.

    Article  MathSciNet  MATH  Google Scholar 

  32. Stefanescu, G. (1987). On flowchart theories: Part II. The nondeterministic case. Theoretical Computer Science, 52, 307–340.

    Article  MathSciNet  MATH  Google Scholar 

  33. Stefanescu, G. (1986). Feedback theories (a calculus for isomorphism classes of flowchart schemes). Preprint Series in Mathematics No. 24, National Institute for Scientific and Technical Creation, Bucharest. Also in: Revue Roumaine de Mathematiques Pures et Applique, 35, 73–79, 1990.

    Google Scholar 

  34. Stefanescu, G. (1998). Reaction and control I. Mixing additive and multiplicative network algebras. Logic Journal of the IGPL, 6(2), 349–368.

    Article  MathSciNet  MATH  Google Scholar 

  35. Stefanescu, G. (2000). Network algebra. Springer-Verlag.

    Google Scholar 

  36. Stefanescu, G. (2001). Kleene algebras of two dimensional words: A model for interactive systems. Dagstuhl Seminar on “Applications of Kleene algebras”, Seminar 01081.

    Google Scholar 

  37. Zielonka, W. (1987). Notes on finite asynchronous automata. Theoretical Informatics and Applications, 21, 99–135.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Singapore, Singapore

    G. Stefanescu

Authors
  1. G. Stefanescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematisches Institut, Ludwig-Maximilians-Universität, München, Germany

    Helmut Schwichtenberg

  2. Institut für Informatik, Technische Universität, München, Germany

    Ralf Steinbrüggen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Stefanescu, G. (2002). Algebra of Networks. In: Schwichtenberg, H., Steinbrüggen, R. (eds) Proof and System-Reliability. NATO Science Series, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0413-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-0413-8_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-0608-1

  • Online ISBN: 978-94-010-0413-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation