Skip to main content
SpringerLink
Log in
Book cover

Formal Methods in Programming and Their Applications pp 239–250Cite as

Observing some properties of event structures

  • Conference paper
  • First Online:

  • 137 Accesses

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

Abstract

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.

This work is suppoted in part by the Fundamental Research Fund of Russia (grant No 93-012-986).

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. Best, E.: The relative strenghth of K-density. Lecture Notes in Computer Science 84 (1980) 261–276

    Google Scholar 

  2. Best, E.: A Theorem on the Characteristics of Non-Sequential Processes. Fundamenta Informaticae 3 (1980) 77–94

    Google Scholar 

  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. Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science 59 (1988) 25–84

    Google Scholar 

  5. Cherkasova, L., Kotov, V.: Descriptive and analytical process algebras. Lecture Notes in Computer Science 424 (1989) 77–104

    Google Scholar 

  6. Fernandez, C.: Non-sequential processes. Lecture Notes in Computer Science 254 (1986) 95–116

    Google Scholar 

  7. Kotov, V., Cherkasova, L.: On structural properties of generalized processes. Lecture Notes in Computer Science 188 (1984) 288–306

    Google Scholar 

  8. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science 13 (1981) 85–108

    Google Scholar 

  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. Plünnecke, H.: K-density, N-density and finiteness properties. Lecture Notes in Computer Science 188 (1984) 392–412

    Google Scholar 

  11. Virbitskaite, I., Votintseva A.,: A Temporal Logic Characterization of a Subclass of Flow Event Structures. (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, 630090, Novosibirsk, Russia

    I. B. Virbitskaite

Authors
  1. I. B. Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Virbitskaite, I.B. (1993). Observing some properties of event structures. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039711

Download citation

  • DOI: https://doi.org/10.1007/BFb0039711

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57316-6

  • Online ISBN: 978-3-540-48056-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation