Skip to main content
SpringerLink
Log in

Algorithm to construct the behavior of concurrent systems represented by modified path expressions

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The operation of a concurrent system is represented by a set of labeled partially ordered sets (traces). An efficient procedure is suggested for generating the set of all traces in systems where the cooperation between concurrent subsystems is described by path expressions of a special kind.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. R. Janicki, P. Lauer, and R. Devillers, “Maximally concurrent evolution of nonsequential systems”, Lect. Notes Comput. Sci.,197, 268–281 (1985).

    Google Scholar 

  2. A. Masurkiewicz, “Semantics of concurrent systems: a modular fixed point approach”, Lect. Notes Comput. Sci.,129, 353–376 (1984).

    Google Scholar 

  3. J. Bakker, J. R. Kock, M. E. Yergg, et al., “Contrasting themes in the semantics of imperative concurrency”, Lect. Notes Comput. Sci.,224, 12–25 (1986).

    Google Scholar 

  4. J. Bakker, Designing Concurrency Semantics, North-Holland, Amsterdam (1989), pp. 104–117.

    Google Scholar 

  5. P. E. Lauer and P. N. Campbell, “Formal semantics for a class of high level primitives for a coordinating concurrent process”, Acta Inform.,5, 297–332 (1975).

    Google Scholar 

  6. P. E. Lauer and M. Shields, “On abstract specification and formal analysis of properties of concurrent systems”, in: Requirements and Specifications in Program Development [Russian translation], Mir, Moscow (1984), pp. 77–105.

    Google Scholar 

  7. V. E. Kotov, Petri Nets [in Russian], Nauka, Moscow (1984).

    Google Scholar 

Download references

Authors
  1. V. A. Kalashnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Pankrats
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 35–39, January–February, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalashnikova, V.A., Pankrats, E.V. Algorithm to construct the behavior of concurrent systems represented by modified path expressions. Cybern Syst Anal 27, 47–53 (1991). https://doi.org/10.1007/BF01068646

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation