✦ LIBER ✦

On equivalence-completions of fairness assumptions

✍ Scribed by Nissim Francez; Ralph -J. J. Back; Reino Kurki-Suonio

Publisher: Springer
Year: 1992
Tongue: English
Weight: 580 KB
Volume: 4
Category: Article
ISSN: 0934-5043
DOI: 10.1007/bf01211476

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Control of ω-automata under state fairne

Control of ω-automata under state fairness assumptions

✍ J.G. Thistle; R.P. Malhamé 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 113 KB

This article studies the deadlock-free control of ÿnite automata subject to speciÿcations in the form of Rabin acceptance conditions. Automata are assumed to satisfy a state fairness condition, whereby any transition that is inÿnitely often enabled (by both the underlying dynamics and the control me

Completeness of fair ASM refinement

✍ Gerhard Schellhorn 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 321 KB

ASM refinements are verified using generalized forward simulations which allow us to refine m abstract operations to n concrete operations with arbitrary m and n. One main difference from data refinement is that ASM refinement considers infinite runs and termination. Since backward simulation does n

On feedback equivalence and completion p

On feedback equivalence and completion problems

✍ Fernando C. Silva 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 508 KB

In 1987, I. Zaballa characterized the possible similarity classes of a square matrix with some prescribed rows. In 1988, the same author characterized the possible feedback equivalence classes of [ A B ], where A is a fixed square matrix and B varies. Firstly, in this paper, we observe that these re

On weakly pre-complete positive equivale

On weakly pre-complete positive equivalences

✍ S. A. Badaev 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 315 KB

Fair Hamilton Decompositions of Complete

Fair Hamilton Decompositions of Complete Multipartite Graphs

✍ C.D. Leach; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices

On Products of CAUCHY Completions

✍ D. C. Kent; R. Ruiz de Eguino 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

## Abstract We investigate conditions under which the completion of a product of CAUCHY spaces is equivalent to the product of the completions. Necessary and sufficient conditions are given for the WYLER completion to commute with products. The natural completion and natural ordered completion are