Skip to main content
SpringerLink
Log in

Algebra of regular Petri nets

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. C. A. Petri, Kommunikation mit Automaten, Bonn Univ. (1962).

  2. A. W. Holt and F. Commoner, “Events and conditions,” in: Record of the Project MAC Conf. on Concurrent System and Parallel Computation, New York, (1970), pp. 3–52.

  3. R. M. Karp and R. E. Miller, “Parallel program schemes,” Kibern. Sb., New Ser., No. 13, 5–61 (1976)

    Google Scholar 

  4. R. Keller, Vector Replacement Systems: A Formalism for Modeling Asynchronous Systems TR 117, Comput. Sci. Lab., Princeton Univ. (1972).

  5. R. E. Miller, “A comparison of some theoretical models of parallel computation” IEEE Trans. Comp.C22, No. 8, 710–717 (1973).

    Google Scholar 

  6. J. L. Peterson and T. H. Bredt, “A comparison of models of parallel computation,” in: Proc. IFIP Congress 74, North-Holland, Amsterdam (1974), pp. 466–470.

    Google Scholar 

  7. P. E. Lauer and R. H. Campbell, “Formal semantics for a class of high-level primitives for coordinating concurrent processes,” Acta Inf., No. 5, 297–332 (1975).

    Google Scholar 

  8. V. E. Kotov, “Concurrent programming with control types,” in: Constructing Quality Software, North-Holland, Amsterdam (1978), pp. 207–228.

    Google Scholar 

  9. R. C. Holt, On Deadlock in Computer Systems,TR CSRG-6, Univ. of Toronto (1972).

  10. K. Lautenbach and H. A. Schmid, “Use of Petri nets for proving correctness of concurrent process systems,” in: Proc. IFIP Congress 74, North-Holland, Amsterdam (1974), pp. 187–191.

    Google Scholar 

  11. M. Hack, Decision Problems for Petri Nets and Vector Addition Systems, MAC-TM 59, Project MAC, MIT (1974).

  12. M. Hack, Decidability Question for Petri Nets TR 161, MIT Lab for Comp. Sci. (1976).

  13. G. S. Sacerdote and R. L. Tenney, “The decidability of the reachability problem for vector addition systems,” COINS Technical Report No. 77-3, Univ. of Massachusetts (1977).

  14. M. Hack, Petri Net Languages, TR 159, MIT Lab. for Comp. Sci. (1976).

  15. V. E. Kotov, “Algebra of regular Petri nets,” Preprint Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, No. 98, Novosibirsk (1978).

Download references

Authors
  1. V. E. Kotov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 10–18, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kotov, V.E. Algebra of regular Petri nets. Cybern Syst Anal 16, 642–652 (1980). https://doi.org/10.1007/BF01078492

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation