Concurrent Semantics Without the Notions of State or State Transitions

  • Edward A. Lee
Conference paper

DOI: 10.1007/11867340_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4202)
Cite this paper as:
Lee E.A. (2006) Concurrent Semantics Without the Notions of State or State Transitions. In: Asarin E., Bouyer P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2006. Lecture Notes in Computer Science, vol 4202. Springer, Berlin, Heidelberg


This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deeply rooted in our notions of computation, but these roots have proved problematic in concurrent software in general, where they have led to such poor programming practice as threads. I review approaches (some of which have been around for some time) to the semantics of concurrent programs that rely on neither state nor state transitions. Specifically, these approaches rely on a broadened notion of computation consisting of interacting components. The semantics of a concurrent compositions of such components generally reduces to a fixed point problem. Two families of fixed point problems have emerged, one based on metric spaces and their generalizations, and the other based on domain theories. The purpose of this paper is to argue for these approaches over those based on transition systems, which require the notion of state.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Edward A. Lee
    • 1
  1. 1.University of CaliforniaBerkeley

Personalised recommendations