Skip to main content

Concurrency and computability

  • Conference paper
  • First Online:
Semantics of Systems of Concurrent Processes (LITP 1990)

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

Included in the following conference series:

  • 142 Accesses

Abstract

This paper surveys some computability aspects in structural operational specifications, fairness concepts and testing equivalences, with special emphasis on infinite behaviours.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Badouel. Une construction systématique de modèles à partir de spécifications opérationnelles structurelles, INRIA-RR 764, 1987

    Google Scholar 

  2. E. Badouel, Ph. Darondeau. A Note on Guarded Recursion, IRISA-PI 535, 1990

    Google Scholar 

  3. J.W. de Bakker, J.J.Ch. Meyer, E.R. Olderog. Infinite streams and finite observations in the semantics of uniform concurrency, TCS 49, pp.87–112, 1987

    Google Scholar 

  4. B. Bloom, S. Istrail, A.R. Meyer. Bisimulation can't be traced: preliminary report, 15th ACM-POPL, pp.229–239, 1988

    Google Scholar 

  5. G. Boudol. Notes on algebraic calculi of processes, in: Logics and Models of Concurrent Systems (Apt ed.), Springer Verlag NATO-ASI series, 1985

    Google Scholar 

  6. Ph. Darondeau. Bisimulation and effectiveness, IPL 30, pp. 19–20, 1989

    Google Scholar 

  7. Ph. Darondeau. Quelques problèmes relatifs à la composition parallèle, Congrès AFCET (Gif sur Yvette), Editions Hommes et Techniques, 1981

    Google Scholar 

  8. Ph. Darondeau. Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages, Informatique théorique et applications 20(3), pp.291–317, 1986

    Google Scholar 

  9. Ph. Darondeau, B. Gamatié. Modelling infinitary behaviours of communicating systems, INRIA-RR 749, 1987

    Google Scholar 

  10. Ph. Darondeau, B. Gamatié. Infinitary behaviours and infinitary observations (to appear in Fundamenta Informaticae)

    Google Scholar 

  11. Ph. Darondeau, L. Kott. On the observational semantics of fair parallelism, 10th ICALP, LNCS 154, pp.147–159, 1983

    Google Scholar 

  12. Ph. Darondeau, D. Nolte, L. Priese, S. Yoccoz. Fairness, distances and degrees. INRIA-RR 1199, 1990

    Google Scholar 

  13. Ph. Darondeau, S. Yoccoz. Proof systems for infinite behaviours (to appear in Information and Computation)

    Google Scholar 

  14. P. Degano, U. Montanari. Liveness properties as convergence in metric spaces, STOC, pp.31–38, 1984

    Google Scholar 

  15. R. De Nicola, M. Hennessy. Testing equivalences for processes, TCS 34, pp.83–113, 1984

    Google Scholar 

  16. R. De Simone. Calculabilité et expressivité dans l'algèbre de processus MEIJE, thèse de 3eme cycle, Paris VII, 1984

    Google Scholar 

  17. J. Dugundji. Topology, Allyn and Bacon, 1966

    Google Scholar 

  18. N. Francez. Fairness, Springer Verlag, 1986

    Google Scholar 

  19. J.Y. Girard. Proof theory and logical complexity (vol.1) Bibliopolis (Napoli), 1987

    Google Scholar 

  20. J.Y. Girard, 11 12 logic, part 1: dilators, Annals of Mathematical Logic 21, pp.75–219, 1981

    Google Scholar 

  21. R. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebras, STACS, LNCS 247, pp.336–347, 1987

    Google Scholar 

  22. J.F. Groote. Transition system specifications with negative premisses, CWI, CS-R8950, 1989

    Google Scholar 

  23. J.F. Groote, F. Vaandrager. Structured operational semantics and bisimulation as a congruence, 16th ICALP, LNCS 372, pp.423–438, 1989

    Google Scholar 

  24. R. Milner. Calculi for synchrony and asynchrony, TCS 25, pp.267–310, 1983

    Google Scholar 

  25. R. Miner. A calculus of communicating systems, LNCS 92, 1980

    Google Scholar 

  26. D. Park. Concurrency and automata on infinite sequences, 5th GI-Conf. LNCS 104, pp.167–183, 1981

    Google Scholar 

  27. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems, 12th ICALP, LNCS 194, pp.15–32, 1985

    Google Scholar 

  28. G. Plotkin. A structural approach to operational semantics, DAIMI FN-19 Aarhus Univ., 1981

    Google Scholar 

  29. H. Rogers. Theory of recursive functions and effective computability, Mc Graw Hill, 1967

    Google Scholar 

  30. J. Rutten. Deriving metric models for bisimulation from transition system specifications, Int. Workshop and Tutorial on formal models of concurrent computations, Telavi, Georgia, USSR, 1989

    Google Scholar 

  31. K. Wagner. Eine Axiomatisierung der Theorie der regulären Folgenmengen, EIK 12, pp.337–354, 1976

    Google Scholar 

  32. S. Yoccoz. Effective solutions to domain equations: an approach to effective denotational semantics. To appear in CONCUR, Amsterdam, 1990

    Google Scholar 

  33. S. Yoccoz. Recursive omega-rule for proof systems. IPL 31, pp. 291–294, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Darondeau, P. (1990). Concurrency and computability. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53479-2

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics