Skip to main content
Conference Proceedings

Hypertransition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 775 LNCS 327-338
DOI: 10.1007/3-540-57785-8_152
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Arnold, A. (1994). Hypertransition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 327–338). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_152

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free