Skip to main content
SpringerLink
Log in

On continuous time agents

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1991)

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

Abstract

Continuous time agents are studied in an enriched categorical framework that allows for a comprehensive treatment of both the interleaving and the true concurrent paradigms in parallelism. The starting point is a paper by Cardelli, where actions have a duration in a (dense) time domain. More recent works are also briefly considered and some possible directions towards timed “true concurrent” processes are indicated.

This work has been partially supported by the “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo”, CNR, Italy.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bénabou, J.: “Catégories relatives”, C.R.A.S. 260 (1965), 3824–3827.

    Google Scholar 

  2. Bénabou, J.: “Introduction to Bicategories”, in LNM 47, Springer Verlag, Berlin (1967), 1–77.

    Google Scholar 

  3. Bénabou, J.: “Wandering and wondering about the high trees”, (1984), (manuscript).

    Google Scholar 

  4. Benson,D.: “Bialgebras: Some Foundations for Distributed and Concurrent Computation”, Fundamenta Informaticae, 12 (1989), 427–486.

    Google Scholar 

  5. Bergstra, J.A. and Klop, J.W.: “Algebra of Communicating Processes with Abstraction”. Theoretical Computer Science, Vol.37, No.1 (1985), 77–121.

    Article  Google Scholar 

  6. Betti R.: “Automi e categorie chiuse” Boll. Unione Matem. Ital. (5) 17–13 (1980), 44–58.

    Google Scholar 

  7. Betti, R. and Walters R.F.C. “Closed bicategories and variable category theory”, Quaderno 5/P (1985), Dip. Mat.Univ. Milano.

    Google Scholar 

  8. Betti, R. and Walters R.F.C. “On completeness of locally internal categories”, Journal of Pure and Appl. Algebra (1987), 105–117.

    Google Scholar 

  9. Brookes, S. D., Hoare, C.A.R., and Roscoe, A.W.: “A Theory of Communicating Sequential Processes” J.A.C.M. 31, 3 (1984), 560–599.

    MathSciNet  Google Scholar 

  10. Cardelli, L.: “Real Time Agents” Proc. ICALP 1982, LNCS n. 140 (1982), 94–106.

    Google Scholar 

  11. Carboni, A. and Walters, R.F.C.: “Cartesian Bicategories I” J. Pure Applied Algebra 49, (1987), 11–32.

    Google Scholar 

  12. R.Casley, R.Crew, J.Meseguer, V.Pratt, “Temporal structures”, LNCS 389, 1989.

    Google Scholar 

  13. Carboni A., Kasangian S., Walters R., “An Axiomatics for Bicategories of Modules”, Journal of Pure and Appl.Algebra, 45 (1987), 127–141.

    Google Scholar 

  14. Davies, J., Jackson,D., Schneider, S.: “Making things happen in timed CSP” Tech. Report, Oxford, 1990.

    Google Scholar 

  15. Degano, P., Meseguer, J., and Montanari, U.: “Axiomatizing Net Computations and Processes”, Fourth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, (1989), 175–185.

    Google Scholar 

  16. Degano, P. and Montanari, U.: “Concurrent Histories: A Basis for Observing Distributed Systems”, Journal of Computer and System Science, 34 (1987), 422–461.

    Google Scholar 

  17. De Nicola, R. and Labella, A. “A functorial assessment for bisimulation” preprint, 1991

    Google Scholar 

  18. Eilenberg, S. and Kelly, G.M.: “Closed Categories” Proc. of the Conference on Categorical Algebra. La Jolla 1965, Springer Verlag (1966), 421–562.

    Google Scholar 

  19. Gerth, R., Boucher,A.:“A timed failures model for extended communicating processes”, ICALP '87, Springer LNCS 267, 1987

    Google Scholar 

  20. Hennessy,M. Algebraic Theory of Processes, MIT Press, 1988.

    Google Scholar 

  21. Jeffrey,A.: “Timed process algebra ≠ time x process algebra”, Preprint, Chalmers, 1991.

    Google Scholar 

  22. Josephs M. and Goswami A., “Relating computation and time” Tech. Report RR138, Department of Computer Science, University of Warwick, 1985.

    Google Scholar 

  23. Kasangian, S., Kelly, G.M., and Rossi, F.: “Cofibrations and the Realization of Nondeterministic Automata” Cahiers de Topologie et Géométrie Différentielle, XXIV 1 (1983), 23–46.

    Google Scholar 

  24. Kasangian, S. and Labella, A.:“Enriched Categorical Semantics for Distributed Calculi” to appear in Journal of Pure and Applied Algebra, 1990.

    Google Scholar 

  25. Kasangian, S., Labella, A. and Pettorossi, A.: “Enriched Categories for Local and Interaction Calculi”, LNCS 283, Springer Verlag, Berlin (1987), 57–70.

    Google Scholar 

  26. Kasangian, S., Pacco, W.: “An enriched categorical characterization of SCCS”, preprint, 1991.

    Google Scholar 

  27. Kapranov, M. and Voevodsky V.: “Braided monoidal 2-categories, 2-vector spaces and Zamolodchikov's tetrahedra equations”, Preprint 1991.

    Google Scholar 

  28. Kelly, G.M.: “Basic Concepts of Enriched Category Theory”, Cambridge University Press, Cambridge (1982).

    Google Scholar 

  29. Lawvere, F.W.: “Metric Spaces, Generalized Logic, and Closed Categories“ Rendiconti del Seminario Matematico e Fisico, Milano 43 (1973), 135–166.

    Google Scholar 

  30. Mazurkiewicz, A.: “Trace theory”, LNCS 255, Springer Verlag, Berlin (1987), 279–324.

    Google Scholar 

  31. Meseguer, J., and Montanari, U.:“Petri Nets are Monoids: A New Algebraic Foundation for Net Theory” Proc. 3rd Annual Symposium on Logic in Computer Science, June 5–8, 1988, Edinburgh (Scotland), 155–164.

    Google Scholar 

  32. Milner, R.: “Calculi for Synchrony and Asynchrony” Theoretical Computer Science, Vol.25 (1983), 267–310.

    Article  Google Scholar 

  33. Moller, F.,Tofts, C.: “A temporal calculus of communicating systems”, Preprint, Edinburgh, 1989.

    Google Scholar 

  34. Murphy D.: “3 papers on classical concurrency theory”, CS Report, Glasgow, 1991.

    Google Scholar 

  35. Pratt, V.: “Modelling Concurrency with Partial Orders” International Journal of Parallel Programming, v.15, 1(1986), 33–71.

    Article  Google Scholar 

  36. Reisig, W.:“Petri Nets: an Introduction” EATCS Monographs on Theoretical Computer Science, Vol.4, Springer Verlag (1985).

    Google Scholar 

  37. Schneider, S.: “An operational semantics for timed CSP”, Tech. Report, Oxford, 1991.

    Google Scholar 

  38. Stark,E.: “Concurrent Transition Systems”, Theoretical Computer Science 64 (1989) 221–269.

    Google Scholar 

  39. Tofts,C.: “Temporal Ordering for Concurrency”, Univ.of Edinburgh Report LFCS-49-88, 1988

    Google Scholar 

  40. Walters, R.F.C.:“Sheaves and Cauchy-Complete Categories” Cahiers de Top. et Géom. Diff. 22. (1981), 283–286.

    Google Scholar 

  41. Walters R.F.C.: “Sheaves on sites as Cauchy-complete Categories”, Journal of Pure and Appl.Algebra, 24, 1982, 95–102.

    Google Scholar 

  42. Winskel, G.: “Synchronization Trees” Theoretical Computer Science, 34 (1984), 33–82.

    Google Scholar 

  43. Winskel, G.: “Event structures”, LNCS 255, Springer Verlag (1987), 325–392.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Milano, Italy

    S. Kasangian

  2. Dipartimento di Matematica, Università di Roma “La Sapienza”, Australia

    A. Labella

Authors
  1. S. Kasangian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Labella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kasangian, S., Labella, A. (1992). On continuous time agents. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1991. Lecture Notes in Computer Science, vol 598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55511-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-55511-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55511-7

  • Online ISBN: 978-3-540-47194-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation