Observing some properties of event structures

  • I. B. Virbitskaite
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 735)


The intention of the paper is to study prime event structures as models of nondeterministic processes. We characterize and examine some properties known as discreteness, density and crossing which allow inconsistency to be avoided between syntactic and semantic representations of processes. A number of close relationships between density and crossing concepts of the chosen model is shown. An algebraic system whose terms are interpreted as dense prime event structures is proposed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Best, E.: The relative strenghth of K-density. Lecture Notes in Computer Science 84 (1980) 261–276Google Scholar
  2. 2.
    Best, E.: A Theorem on the Characteristics of Non-Sequential Processes. Fundamenta Informaticae 3 (1980) 77–94Google Scholar
  3. 3.
    Best, E., Fernandez, C., Plünnecke, H.: Concurrent systems and processes. Final Report on the Foundational Part of the Project BEGRUND, FMP-Studien N 107, GMD, Sankt Augustin, FDR (March 1985)Google Scholar
  4. 4.
    Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science 59 (1988) 25–84Google Scholar
  5. 5.
    Cherkasova, L., Kotov, V.: Descriptive and analytical process algebras. Lecture Notes in Computer Science 424 (1989) 77–104Google Scholar
  6. 6.
    Fernandez, C.: Non-sequential processes. Lecture Notes in Computer Science 254 (1986) 95–116Google Scholar
  7. 7.
    Kotov, V., Cherkasova, L.: On structural properties of generalized processes. Lecture Notes in Computer Science 188 (1984) 288–306Google Scholar
  8. 8.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science 13 (1981) 85–108Google Scholar
  9. 9.
    Petri, C.: Concurrency as a basis for system thinking. ISP-Report 78.06, St. Augustin: Gesellschaft für Mathematik und Detenverarbeitung (1978)Google Scholar
  10. 10.
    Plünnecke, H.: K-density, N-density and finiteness properties. Lecture Notes in Computer Science 188 (1984) 392–412Google Scholar
  11. 11.
    Virbitskaite, I., Votintseva A.,: A Temporal Logic Characterization of a Subclass of Flow Event Structures. (in preparation)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • I. B. Virbitskaite
    • 1
  1. 1.Institute of Informatics SystemsSiberian Division of the Russian Academy of SciencesNovosibirskRussia

Personalised recommendations