Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1994: Automata, Languages and Programming pp 376–387Cite as

Generalizing finiteness conditions of labelled transition systems

Extended abstract

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. America and J.J.M.M. Rutten. Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. Journal of Computer and System Sciences, 39:343–375, 1989.

    Google Scholar 

  2. A. Arnold and M. Nivat. Metric Interpretations of Infinite Trees and Semantics of Nondeterministic Recursive Programs. Theoretical Computer Science, 11:181–205, 1980.

    Google Scholar 

  3. J.C.M. Baeten and J.A. Bergstra. Real Time Process Algebra. Formal Aspects of Computing, 3:142–188, 1991.

    Google Scholar 

  4. J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch. Meyer. Linear Time and Branching Time Semantics for Recursion with Merge. Theoretical Computer Science, 34:135–156, 1984.

    Google Scholar 

  5. J.W. de Bakker and F. van Breugel. Topological Models for Higher Order Control Flow. Report CS-R9340, CWI, Amsterdam, 1993. To appear in Proceedings of MFPS 93.

    Google Scholar 

  6. J.W. de Bakker and J.J.M.M. Rutten, editors. Ten Years of Concurrency Semantics, selected papers of the Amsterdam Concurrency Group. World Scientific, Singapore, 1992.

    Google Scholar 

  7. J.W. de Bakker and J.H.A. Warmerdam. Four Domains for Concurrency. Theoretical Computer Science, 90:127–149, 1991.

    Google Scholar 

  8. J.W. de Bakker and J.I. Zucker. Compactness in Semantics for Merge and Fair Merge. In Proceedings of 4th Workshop on Logics of Programs, volume 164 of LNCS, pages 18–33. Springer-Verlag, 1983.

    Google Scholar 

  9. W. Brauer. Zu den Grundlagen einer Theorie Topologischer Sequentieller Systeme und Automaten. GMD, Bonn, 1970.

    Google Scholar 

  10. F. van Breugel. Comparative Semantics for a Real-Time Programming Language with Integration. Report IR-239, Vrije Universiteit, Amsterdam, 1991. Extended abstract appeared in Proceedings of TAPSOFT 91, volume 493 of LNCS, pages 397–411. Springer-Verlag.

    Google Scholar 

  11. F. van Breugel. Generalizing Finiteness Conditions of Labelled Transition Systems. Report CS-R9365, CWI, Amsterdam, 1993.

    Google Scholar 

  12. F. van Breugel. Three Metric Domains of Processes for Bisimulation. Report CS-R9335, CWI, Amsterdam, 1993. To appear in Proceedings of MFPS 93.

    Google Scholar 

  13. F. van Breugel. Topological Models in Comparative Semantics. PhD thesis, Vrije Universiteit, Amsterdam, 1994. In preparation.

    Google Scholar 

  14. S. Ginsburg. An Introduction to Mathematical Machine Theory. Addison-Wesley, Reading, Massachusetts, 1962.

    Google Scholar 

  15. R.J. van Glabbeek and J.J.M.M. Rutten. The Processes of De Bakker and Zucker represent Bisimulation Equivalence Classes. In J.W. de Bakker, 25 jaar semantiek, pages 243–246. CWI, Amsterdam, 1989.

    Google Scholar 

  16. M. Hennessy and G.D. Plotkin. Full Abstraction for a Simple Parallel Programming Language. In Proceedings of MFCS 79, volume 74 of LNCS, pages 108–120. Springer-Verlag, 1979.

    Google Scholar 

  17. J.N. Kok and J.J.M.M. Rutten. Contractions in Comparing Concurrency Semantics. Theoretical Computer Science, 76:179–222, 1990.

    Google Scholar 

  18. M. Nivat. Infinite Words, Infinite Trees, Infinite Computations. In Foundations of Computer Science III, volume 109 of Mathematical Centre Tracts, pages 3–52. Mathematical Centre, Amsterdam, 1979.

    Google Scholar 

  19. G.D. Plotkin. A Structural Approach to Operational Semantics. Report DAIMI FN-19, Aarhus University, Aarhus, 1981.

    Google Scholar 

  20. G.M. Reed. A Hierarchy of Domains for Real-Time Distributed Computing. In Proceedings of MFPS 89, volume 442 of LNCS, pages 80–128. Springer-Verlag, 1989.

    Google Scholar 

  21. J.J.M.M. Rutten. Semantic Correctness for a Parallel Object-Oriented Language. SIAM Journal of Computation, 19:341–383, 1990.

    Google Scholar 

  22. J.J.M.M. Rutten. Processes as Terms: non-well-founded models for bisimulation. Mathematical Structures in Computer Science, 2:257–275, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Technology, CWI, Kruislaan 413, 1098, SJ Amsterdam

    Franck van Breugel

  2. Department of Mathematics and Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081, HV Amsterdam

    Franck van Breugel

Authors
  1. Franck van Breugel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Breugel, F. (1994). Generalizing finiteness conditions of labelled transition systems. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation