Skip to main content
SpringerLink
Log in

Compositional generation of home states in free choice systems

  • Concurrency II
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

Free choice nets are a class of Petri nets allowing to model concurrency and nondeterministic choice, but with the restriction that choices cannot be influenced externally. Home states are ground states which lead to a strongly connected state graph, that is, a home state can be reached from any of its successor states. The main result of this paper characterises the home states of a structurally live and bounded free choice system compositionally by recourse to its decomposition into T-components.

Work done partly within the Esprit Basic Research Action No.3148 D→E→M→O→N — Design Methods Based on Nets and within SFB 342 WG A3: SEMAFOR

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol.2 No.2, 123–138 (1990).

    Article  Google Scholar 

  2. E. Best, L. Cherkasova, J. Desel and J. Esparza: Characterisation of Home States in Free Choice Systems. Hildesheimer Informatik-Berichte Nr. 9/90 (September 1990).

    Google Scholar 

  3. E. Best, J. Desel and J. Esparza: Traps Characterise Home States in Free Choice Systems. Submitted Paper (June 1990).

    Google Scholar 

  4. F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol.5, 511–523 (1971).

    Google Scholar 

  5. J. Desel and J. Esparza: Reachability in Reversible Free Choice Systems. Proceedings of STACS'91, Lecture Notes in Computer Science, Springer Verlag (1991).

    Google Scholar 

  6. H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol.2, 143–161 (1973).

    Article  Google Scholar 

  7. M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972). Corrections (1974).

    Google Scholar 

  8. W. Reisig: Petri Nets — an Introduction. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hildesheim, D-3200, Hildesheim

    Eike Best

  2. Institute of Informatics Systems, USSR Academy of Sciences, 630090, Novosibirsk

    Ludmila Cherkasova

  3. Institut für Informatik, Technische Universität München, D-8000, München

    Jörg Desel

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ludmila Cherkasova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Cherkasova, L., Desel, J. (1991). Compositional generation of home states in free choice systems. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020815

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation