Quiescence, Fairness, Testing, and the Notion of Implementation

Two formalisms for concurrency, the Input/Output automaton model and the theory of testing, are compared and are shown to have common foundations. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide subject to some res...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 138; číslo 2; s. 194 - 210
Hlavný autor:	Segala, Roberto
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.11.1997 Elsevier
Predmet:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata. Abstract machines. Turing machines Computer science; control theory; systems Exact sciences and technology Theoretical computing Concurrency Computational complexity Automata theory Implementation Algorithm complexity
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	Two formalisms for concurrency, the Input/Output automaton model and the theory of testing, are compared and are shown to have common foundations. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide subject to some restrictions. I/O automata are encoded into the theory of testing and the reversedmustpreorder is shown to be equivalent to the quiescent preorder for strongly convergent, finitely branching I/O automata up to encoding. Conversely, a theory of testing is defined directly on I/O automata, and the new reversedmustpreorder is shown to coincide with the quiescent preorder on strongly convergent, finitely branching I/O automata.
ISSN:	0890-5401 1090-2651
DOI:	10.1006/inco.1997.2652