Durations for truly-concurrent transitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1058, Issue , 1996, Pages 173-187

  Goubault, Eric ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS;

CARTESIANS; COMBINATORS; HIGHER DIMENSIONAL AUTOMATA; MORPHISMS; OPERATIONAL MODEL; TIME CHANGE; TRANSITION SYSTEM; TRUE CONCURRENCY;

REAL TIME SYSTEMS;

EID: 84947904281     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_36     Document Type: Conference Paper

References (31)

1. S. Abramsky and T. Maibaum. Handbook of Logic in Computer Science, volume 1. Oxford Press, 1993.
2. L. Aceto and D. Murphy. On the ill-timed, but well-caused. In Proc. of CONCUR'93, number 715 in LNCS, pages 97-111. Springer-Verlag.
3. R. Alur and D. Dill. The theory of timed automata. In Proceedings of the REX Workshop, Real-Time: Theory in Practice, LNCS. Springer-Verlag, 1991.
4. A. Asperti and G. Longo. Categories, types and structures. The MIT Press, second edition, 1991.
5. H. Barringer, R. Kuiper, and A. Pnueli. A really abstract concurrent model and its temporal logic. In Proc. of the 13th POPL, pages 173-183. ACM Press, 1986.
6. M.A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988.
7. R. Cleaveland and A. Zwarico. A theory of testing for real-time. In Proceedings of LICS. IEEE Press, 1991.
8. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4, pages 238-252, 1977.
9. R. Cridlig and E. Goubault. Semantics and analyses of Linda-based languages. In Proc. of WSA '93, number 724 in LNCS. Springer-Verlag, 1993.
10. P. Gabriel and M. Zisman. Calculus fractions and homotopy theory. In Ergebnisse der Mathematik und ihrer Grenzgebiete, volume 35. Springer Verlag, 1967.
11. E. Goubault. Domains of higher-dimensional automata. In Proc. of CONCUR'93, Hildesheim, August 1993. Springer-Verlag.
12. E. Goubault. Schedulers as abstract interpretations of HDA. In Proc. of PEPM'95, La Jolla, June 1995. ACM Press.
13. E. Goubault. The Geometry of Concurrency. PhD thesis, Ecole Normale Supérieure, to appear, 1995.
14. E. Goubault and T.P. Jensen. Homology of higher-dimensional automata. In Proc. of CON-CUR'92, Stonybrook, New York, August 1992. Springer-Verlag.
15. T.A. Henzinger. The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991.
16. T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In Proc. of the REX Workshop, Real-Time: Theory in Practice, LNCS. Springer-Verlag, 1993.
17. P. Krishnan. A model for real-time systems. In Proc. of Mathematical Foundations of Computer Science, number 520 in LNCS. Springer-Verlag, 1991.
18. A.T. Lundell and S. Weingram. The Topology of CW-Complexes. Van Nostrand Reinhold Company, 1969.
19. A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theoretical Computer Science, 103:335-363.
20. J.P. May. Simplicial objects in algebraic topology. D. van Nostrand Company, inc, 1967.
21. F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proceedings of CON-CUR'90, number 458 in LNCS. Springer-Verlag, 1990.
22. X. Nicollin and J. Sifakis. An overview and synthesis of timed process algebras. In Proc. of CAV'92, number 575 in LNCS, pages 376-398. Springer-Verlag, 1992.
23. G. Plotkin. Domains. Technical report, Computer Science Department, Edinbourgh, 1984.
24. V. Pratt. Modeling concurrency with geometry. In Proc. of the 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.
25. G.M. Reed and A.W. Roscoe. Metric spaces as models for real-time concurrency. In Proc. of Mathematical Foundations of Programming Languages and Semantics, number 298 in LNCS, pages 331-343. Springer-Verlag, 1987.
26. H. Rund. The Differential Geometry of Finsler Spaces. Springer-Verlag, 1959.
27. M.W. Shields. Concurrent machines. Computer Journal, 28, 1985.
28. A. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221-269, 1989.
29. R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.
30. R. van Glabbeek and U. Goltz. Partial order semantics for refinement of actions. Bulletin of the EATCS, (34), 1989.
31. G. Winskel and M. Nielsen. Models for concurrency, volume 3 of Handbook of Logic in Computer Science, pages 100-200. Oxford University Press, 1994.