Skip to main content
SpringerLink
Log in

Hypertransition systems

  • Invited Lecture
  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

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

Included in the following conference series:

Abstract

Hypertransition systems are extensions of transition systems in the same way as tree automata are extensions of word automata and hypergraphs are extensions of graphs. In this paper we explain why we need such an extension in order to model nondeterminism and refinements in systems of concurrent processes.

Unité de Recherche associée au Centre National de la Recherche Scientifique nℴ 1304

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. L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In: Proc. 4th LICS, pages 138–145, IEEE Comp. Soc. 1989.

    Google Scholar 

  2. A. Arnold. Transition systems and concurrent processes. In Mathematical problems in Computation Theory, pages 9–20, Banach Center Publication 21, 1987.

    Google Scholar 

  3. A. Arnold. Systèmes de transitions finis. Sémantique des processus communicants. Masson, 1992.

    Google Scholar 

  4. A. Arnold and P. Guitton. Un modèle de description de protocoles: les réseaux fermés d'automates triphasés. In M. Paul and B. Robinet, editors, 6th International Symposium on Programming, Toulouse, 1984, pages 1–12, Lect. Notes Comput. Sci. 167, 1984.

    Google Scholar 

  5. A. Arnold and M. Nivat. Comportements de processus. In Les Mathématiques de l'Informatique, pages 35–68, Colloque AFCET, Paris, 1982.

    Google Scholar 

  6. R. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In J. W. de Bakker, W.-P. de Roever, G. Rozenberg, editors, Stepwise Refinements of Distributed Systems, pages 267–300, Lect. Notes Comput. Sci. 430, 1989.

    Google Scholar 

  7. N. Francez, C. A. R. Hoare, D. J. Lehmann, and W. P. de Roever. Semantics of nondeterminism, concurrency, and communication. J. Comput. Syst. Sci., 19:290–308, 1979.

    Google Scholar 

  8. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  10. W. Vogler. Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139–162, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux I, France

    André Arnold

Authors
  1. André Arnold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnold, A. (1994). Hypertransition systems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation