On continuous time agents. (English) Zbl 1518.68131
Brookes, Stephen (ed.) et al., Mathematical foundations of programming semantics. 7th international conference, Pittsburgh, PA, USA, March 25–28, 1991. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 598, 403-425 (1992).
Summary: 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 L. Cardelli [Lect. Notes Comput. Sci. 140, 94–106 (1982; Zbl 0493.68017)], 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.
For the entire collection see [Zbl 1517.68006].
For the entire collection see [Zbl 1517.68006].
MSC:
| 68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
| 18D20 | Enriched categories (over closed or monoidal categories) |
| 68Q55 | Semantics in the theory of computing |
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
Citations:
Zbl 0493.68017References:
| [1] | Bénabou, J.: “Catégories relatives”, C.R.A.S. 260 (1965), 3824-3827. · Zbl 0136.00702 |
| [2] | Bénabou, J.: “Introduction to Bicategories”, in LNM 47, Springer Verlag, Berlin (1967), 1-77. · Zbl 1375.18001 |
| [3] | Bénabou, J.: “Wandering and wondering about the high trees”, (1984), (manuscript). |
| [4] | Benson,D.: “Bialgebras: Some Foundations for Distributed and Concurrent Computation”, Fundamenta Informaticae, 12 (1989), 427-486. · Zbl 0689.18009 |
| [5] | Bergstra, J.A. and Klop, J.W.: “Algebra of Communicating Processes with Abstraction”. Theoretical Computer Science, Vol.37, No.1 (1985), 77-121. · Zbl 0579.68016 · doi:10.1016/0304-3975(85)90088-X |
| [6] | Betti R.: “Automi e categorie chiuse” Boll. Unione Matem. Ital. (5) 17-13 (1980), 44-58. · Zbl 0456.18003 |
| [7] | Betti, R. and Walters R.F.C. “Closed bicategories and variable category theory”, Quaderno 5/P (1985), Dip. Mat.Univ. Milano. · Zbl 1464.18008 |
| [8] | Betti, R. and Walters R.F.C. “On completeness of locally internal categories”, Journal of Pure and Appl. Algebra (1987), 105-117. · Zbl 0631.18005 |
| [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. · Zbl 0628.68025 |
| [10] | Cardelli, L.: “Real Time Agents” Proc. ICALP 1982, LNCS n. 140 (1982), 94-106. · Zbl 0493.68017 |
| [11] | Carboni, A. and Walters, R.F.C.: “Cartesian Bicategories I” J. Pure Applied Algebra 49, (1987), 11-32. · Zbl 0637.18003 |
| [12] | R.Casley, R.Crew, J.Meseguer, V.Pratt, “Temporal structures”, LNCS 389, 1989. · Zbl 1493.68241 |
| [13] | Carboni A., Kasangian S., Walters R., “An Axiomatics for Bicategories of Modules”, Journal of Pure and Appl.Algebra, 45 (1987), 127-141. · Zbl 0615.18006 |
| [14] | Davies, J., Jackson,D., Schneider, S.: “Making things happen in timed CSP” Tech. Report, Oxford, 1990. |
| [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. · Zbl 0722.68085 |
| [16] | Degano, P. and Montanari, U.: “Concurrent Histories: A Basis for Observing Distributed Systems”, Journal of Computer and System Science, 34 (1987), 422-461. · Zbl 0619.68017 |
| [17] | De Nicola, R. and Labella, A. “A functorial assessment for bisimulation” preprint, 1991 |
| [18] | Eilenberg, S. and Kelly, G.M.: “Closed Categories” Proc. of the Conference on Categorical Algebra. La Jolla 1965, Springer Verlag (1966), 421-562. · Zbl 0192.10604 |
| [19] | Gerth, R., Boucher,A.:“A timed failures model for extended communicating processes”, ICALP ’87, Springer LNCS 267, 1987 · Zbl 0623.68022 |
| [20] | Hennessy,M. Algebraic Theory of Processes, MIT Press, 1988. · Zbl 0744.68047 |
| [21] | Jeffrey,A.: “Timed process algebra ≠ time x process algebra”, Preprint, Chalmers, 1991. |
| [22] | Josephs M. and Goswami A., “Relating computation and time” Tech. Report RR138, Department of Computer Science, University of Warwick, 1985. |
| [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. · Zbl 0518.18009 |
| [24] | Kasangian, S. and Labella, A.:“Enriched Categorical Semantics for Distributed Calculi” to appear in Journal of Pure and Applied Algebra, 1990. · Zbl 0777.18007 |
| [25] | Kasangian, S., Labella, A. and Pettorossi, A.: “Enriched Categories for Local and Interaction Calculi”, LNCS 283, Springer Verlag, Berlin (1987), 57-70. · Zbl 0639.68023 |
| [26] | Kasangian, S., Pacco, W.: “An enriched categorical characterization of SCCS”, preprint, 1991. |
| [27] | Kapranov, M. and Voevodsky V.: “Braided monoidal 2-categories, 2-vector spaces and Zamolodchikov”s tetrahedra equations”, Preprint 1991. |
| [28] | Kelly, G.M.: “Basic Concepts of Enriched Category Theory”, Cambridge University Press, Cambridge (1982). · Zbl 0478.18005 |
| [29] | Lawvere, F.W.: “Metric Spaces, Generalized Logic, and Closed Categories” Rendiconti del Seminario Matematico e Fisico, Milano 43 (1973), 135-166. · Zbl 0335.18006 |
| [30] | Mazurkiewicz, A.: “Trace theory”, LNCS 255, Springer Verlag, Berlin (1987), 279-324. · Zbl 0633.68051 |
| [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. |
| [32] | Milner, R.: “Calculi for Synchrony and Asynchrony” Theoretical Computer Science, Vol.25 (1983), 267-310. · Zbl 0512.68026 · doi:10.1016/0304-3975(83)90114-7 |
| [33] | Moller, F.,Tofts, C.: “A temporal calculus of communicating systems”, Preprint, Edinburgh, 1989. |
| [34] | Murphy D.: “3 papers on classical concurrency theory”, CS Report, Glasgow, 1991. |
| [35] | Pratt, V.: “Modelling Concurrency with Partial Orders” International Journal of Parallel Programming, v.15, 1(1986), 33-71. · Zbl 0622.68034 · doi:10.1007/BF01379149 |
| [36] | Reisig, W.:“Petri Nets: an Introduction” EATCS Monographs on Theoretical Computer Science, Vol.4, Springer Verlag (1985). · Zbl 0555.68033 |
| [37] | Schneider, S.: “An operational semantics for timed CSP”, Tech. Report, Oxford, 1991. · Zbl 0827.68069 |
| [38] | Stark,E.: “Concurrent Transition Systems”, Theoretical Computer Science 64 (1989) 221-269. · Zbl 0671.68027 |
| [39] | Tofts,C.: “Temporal Ordering for Concurrency”, Univ.of Edinburgh Report LFCS-49-88, 1988 |
| [40] | Walters, R.F.C.:“Sheaves and Cauchy-Complete Categories” Cahiers de Top. et Géom. Diff. 22. (1981), 283-286. · Zbl 0495.18009 |
| [41] | Walters R.F.C.: “Sheaves on sites as Cauchy-complete Categories”, Journal of Pure and Appl.Algebra, 24, 1982, 95-102. · Zbl 0497.18016 |
| [42] | Winskel, G.: “Synchronization Trees” Theoretical Computer Science, 34 (1984), 33-82. · Zbl 0985.68514 |
| [43] | Winskel, G.: “Event structures”, LNCS 255, Springer Verlag (1987), 325-392. · Zbl 0626.68022 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
