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 restrictions. I O automata are encoded into the theory of testing and the reversed must preorder 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 reversed must preorder is shown to coincide with the quiescent preorder on strongly convergent, finitely branching I O automata. ] 1997 Academic Press
منابع مشابه
Divergent Quiescent Transition Systems
Quiescence is a fundamental concept in modelling system behaviour, as it explicitly represents the fact that no output is produced in certain states. The notion of quiescence is also essential to model-based testing: if a particular implementation under test does not provide any output, then the test evaluation algorithm must decide whether or not to allow this behaviour. To explicitly model qu...
متن کاملQuiescence , Fairness , Testing , and Implementation ( Extended abstract ) the Notion of
Abs t rac t . Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automat...
متن کاملQuiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
Two diierent formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded i...
متن کاملRepetitive Quiescence in Implementation and Testing
This paper studies implementation relations and testing based on labelled transition systems, using the assumption that implementations communicate with their environment via inputs and outputs. Such implementations are formalized by restricting the class of transition systems to those systems that can always accept input actions. Implementation relations, which formalize the notion of correctn...
متن کاملA test generation framework for quiescent real - time systems ( Extended Version )
We present an extension of Tretmans’ theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational interpretation of the notion of quiescence in the context of real-time behavior. This gives rise to a family of implementation relations parameterized by observation durations for quiescence. We define a nondeterministic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 138 شماره
صفحات -
تاریخ انتشار 1997