On the ill-timed but well-caused

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

Volumn 715 LNCS, Issue , 1993, Pages 97-111

  Aceto, Luca ^a   Murphy, David ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS;

ACTION REFINEMENT; ASYNCHRONOUS TRANSITION SYSTEM; COMPLEX SEMANTIC STRUCTURES; CONCURRENCY THEORY; CONCURRENT EXECUTION; TIMED PROCESS ALGEBRA; TIMING INFORMATION; TRANSITION SYSTEM;

SEMANTICS;

EID: 85027624992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_8     Document Type: Conference Paper

References (28)

1. L. Aceto, Relating distributed, temporal and causal observations of simple processes, Fundamenta Informaticae, Volume 17 (1992), Number 4, Pp. 369-397.
2. L. Aceto, D. Murphy, Timing and Causality in Process Algebra. In preparation.
3. L. Aceto and M. Hennessy, Towards action-refinement in process algebra, Information and Computation, Volume 103, Number 2 (1993).
4. T. Axford, Concurrent Programming: Fundamental Techniques for Real-Time and Parallel Software Design, Wiley, 1989
5. J. Baeten and J.A. Bergstra, Real time process algebra, Formal Aspects of Computing, Volume 3 (1991), Number 2, Pp. 142-188.
6. J. Baeten and W. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science, Volume 18, Cambridge University Press, 1990.
7. M. Bednarczyk, Categories of asynchronous systems, Ph.D. thesis, Department of Computer Science, University of Sussex, 1987, available as Technical Report Number 3/87.
8. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn, A theory of processes with locality, Technical Report 13/91, Department of Computer Science, University of Sussex, 1991.
9. P. Darondeau and P. Degano. Caused trees, in Automata, Languages and Programming (B. Rovan, Ed.), Volume 372, Springer-Verlag LNCS, 1989.
10. J. Davies and S. Schneider, An introduction to timed CSP, Technical Report Number 75, Oxford University Computer Laboratory, 1989.
11. G. Ferrari, R. Gorrieri, and U. Montanari, Parametric Jaws for concurrency, manuscript, Dipartimento di Informatica, Universitá di Pisa, 1992.
12. R. van Glabbeek, Comparative concurrency semantics and refinement of actions, Ph.D. thesis, Vrije Universiteit te Amsterdam, 1990.
13. J. Godskesen and K. Larsen, Real-time calculi and expansion theorems, in Proceedings of the 1st North American Process Algebra Workshop, 1992.
14. R. Gorrieri, Refinement, atomicity and transactions for process description languages, Ph.D. thesis, Dipartimento di Informatica, Università di Pisa, 1991, available as Technical Report TD 2/91.
15. R. Gorrieri and M. Roccetti, Towards performance evaluation in process algebra. To appear in the proceedings of AMAST 1993.
16. M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal of Computing, Volume 17, Number 5, 1988.
17. M. Hennessy and T. Regan, A temporal process algebra, Technical Report 2/90, Department of Computer Science, University of Sussex, 1990.
18. C. Hoare, Communicating sequential processes, International series on computer science, Prentice-Hall, 1985.
19. M. Joseph and A. Goswami, Relating computation and time, Technical Report RR 138, Department of Computer Science, University of Warwick, 1985.
20. L. Lamport, On interprocess communication. Part I: Basic formalism, Distributed Computing, Volume 1 (1986), Pp. 77-85.
21. A. Mazurkiewicz, Traces, histories, graphs: Instances of a process monoid, in Mathematical Foundations of Computer Science, Volume 176, Springer-Verlag LNCS, 1984.
22. R. Milner, Communication and concurrency, International series on computer science, Prentice Hall International, 1989.
23. F. Moller and C. Tofts, A temporal calculus of communicating systems, in the Proceedings of Concur, Volume 459, Springer-Verlag LNCS, pp. 401-415, 1990.
24. D. Murphy, Intervals and actions in a timed process algebra, Technical Report Arbeitspapiere der GMD 680, Gesellschaft für Mathematik und Dataverarbeitung, St. Augustin, 1992, presented at MFPS ‘92 and submitted to Theoretical Computer Science.
25. X. Nicollin and J. Sifakis, The algebra of timed processes ATP: Theory and application, Technical Report RT-C26, Laboratoire de Génie Informatique de Grenoble, 1990.
26. G. Plotkin, A structurai approach to operational semantics, Technical Report DAIMI-FN-19, Computer Science Department, Århus University, 1981.
27. S. Schneider, An operational semantics for timed CSP, manuscript, Programming Research Group, Oxford University. To appear in Information and Computation.
28. V. Sassone, M. Nielsen and G. Winskel, A classification of models for concurrency, this volume.