Advertisement

Nonwellfounded sets and programming language semantics

  • J. J. M. M. Rutten
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 598)

Abstract

For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositional semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Aczel's anti-foundation-axiom. Solving recursive domain equations in this theory leads to solutions that contain nonwellfounded elements. These are particularly useful for justifying recursive definitions, both of semantic operators and semantic models. The use of nonwellfounded sets further allows for the construction of compositional models for a larger class of transition systems than in the setting of complete metric spaces, which was used before.

1980 Mathematics Subject Classification

68B10 68C01 

1986 Computing Reviews Categories

D.3.1 F.3.2 F.3.3 

Key words and phrases

Structured operational semantics labelled transition system transition system specification bisimulation interpretation compositionality nonwellfounded sets anti-foundation-axiom 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ab87]
    S. Abramsky, Domain theory and the logic of observable properties, PhD thesis, University of London, October 1987.Google Scholar
  2. [Ac88]
    P. Aczel, Non-well-founded sets, CSLI Lecture Notes No. 14, 1988.Google Scholar
  3. [AR89]
    P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, Journal of Computer and System Sciences, Vol. 39, No. 3, 1989, pp. 343–375.CrossRefGoogle Scholar
  4. [BE87]
    J. Barwise, J. Etchemendy, The Liar, an essay on truth and circularity, Oxford University Press, 1987.Google Scholar
  5. [BaKo90]
    J.W. de Barker, J.N. Kok, Comparative metric semantics for Concurrent Prolog, Theoretical Computer Science 75, 1990, pp. 15–43.Google Scholar
  6. [BeK187]
    J.A. Bergstra, J.W. Klop, A convergence theorem in process algebra, Technical Report CS-R8733, Centre for Mathematics and Computer Science, Amsterdam, 1987.Google Scholar
  7. [BIM88]
    B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced: preliminary report, in: Proceedings of the Fifteenth POPL, San Diego, California, 1988, pp. 229–239.Google Scholar
  8. [BZ82]
    J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54, 1982, pp. 70–120.CrossRefGoogle Scholar
  9. [GR89]
    R.J. van Glabbeek, J.J.M.M. Rutten, The processes of De Bakker and Zucker represent bisimulation equivalence classes, in: J.W. de Bakker, 25 jaar semantiek, Centre for Mathematics and Computer Science, Amsterdam, 1989.Google Scholar
  10. [GV88]
    J.F. Groote, F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Technical Report CS-R8845, Centre for Mathematics and Computer Science, Amsterdam, 1988. (To appear in Information and Computation. Extended abstract in: Proceedings 16th ICALP, Stresa, Lecture Notes in Computer Science 372, Springer-Verlag, 1989, pp. 423–438.)Google Scholar
  11. [Mi80]
    R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.Google Scholar
  12. [Pa81]
    D.M.R. Park, Concurrency and automata on infinite sequences, in: Proceedings 5th GI conference, Lecture Notes in Computer Science 104, Springer-Verlag, 1981, pp. 15–32.Google Scholar
  13. [P181]
    G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Comp. Sci. Dept., Aarhus Univ. 1981.Google Scholar
  14. [Ru90]
    J.J.M.M. Rutten, Deriving denotational models for bisimulation from structured operational semantics, in: (M. Broy and C.B. Jones, eds.) Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, Israel, 1990, pp. 155–177.Google Scholar
  15. [Ru92]
    J.J.M.M. Rutten, Processes as terms: Nonwellfounded models for bisimulation, Technical Report, CWI, Amsterdam, in preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • J. J. M. M. Rutten
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAB AmsterdamThe Netherlands

Personalised recommendations