# Fairness and Regularity for Sccs Processes

@article{Guessarian1989FairnessAR, title={Fairness and Regularity for Sccs Processes}, author={Ir{\`e}ne Guessarian and Wafaa Niar-Dinedane}, journal={RAIRO Theor. Informatics Appl.}, year={1989}, volume={23}, pages={59-86} }

We describe varions kinds of fairness (mainly weak and strong fairness) for fînite state SCCS processes by providing an automaton-theoretic characterization of the classes offair languages, To this end, we introducé a variant of Muller automata, the T-automata, which still recognize the class of m-regular languages, and which characterize the classes offair languages. Résumé. Nous décrivons divers types d'équités (principalement Véquité forte et Véquité faible) pour les processus SCCS ayant un…

## 8 Citations

### An Automaton Characterization of Fairness in SCCS

- Computer ScienceSTACS
- 1988

A variant of Muller automata is introduced, the T-automata, which still recognize the class of ω-regular languages, and which characterize the classes of fair languages.

### Muller condition and fairness on multitransition systems

- Computer Science
- 2011

This paper presents an extension of a result by Guessarian and Niar that the set of fair computations of regular SCCS processes coincides with the class of ε -free ω -regular languages to multitransition systems, and inclusions of these fair sets are obtained by showing that the strict fair condition can be simulated by the Muller acceptance condition.

### The Semantics of Fair Recursion with Divergence

- Computer Science
- 1996

This work recast Milner's work on SCCS by giving a denotational semantics for admissibility of innnite computations on a biinite domain K, and obtains a fully abstract model in D K for an operational pre-order which generalizes MilNER's fortiication.

### Decidability of fairness for context-free languages

- Computer ScienceDevelopments in Language Theory
- 1997

It is fairly easy to see that the n-fairness property is decidable for a given context-free language and integer n 1 but the decidability of the corresponding uniform fairness problem remained open.

### Automata on Infinite Objects

- Computer ScienceHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
- 1990

### Synthesis of reactive programs

- Computer Science
- 1995

In addition to the automata-theoretic algorithms, this work gives a synthesis algorithm which synthesizes a program directly from the linear temporal logic ETL.

### Associative and Fair Shuue of !-words

- Mathematics
- 1998

We introduce and investigate some sets of !-trajectories that have the following properties: each of them de nes an associative and commutative operation of parallel composition (shu e) of !-words…

### On fairness of many-dimensional trajectories ( Draft version )

- Computer Science, Mathematics
- 2000

This work introduces natural fairness conditions for the shuue operation deened by a set of many-dimensional trajectories and proves that the initial fairness problem is also decidable for context-free sets ofMany- dimensional trajectories.

## References

SHOWING 1-10 OF 26 REFERENCES

### Concurrency and Automata on Infinite Sequences

- Computer ScienceTheoretical Computer Science
- 1981

A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.

### Bisimulations and Abstraction Homomorphisms

- MathematicsJ. Comput. Syst. Sci.
- 1987

### Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity

- Computer ScienceICALP
- 1986

### Behavioural Equivalence Relations Induced by Programming Logics

- Computer ScienceICALP
- 1983

This paper compares the descriptive power of three programming logics by studying the elementary equivalence relations which the logics induce on nondeterministic state-transition systems and finds that the notions of bisimilarity, Ogden, and observation equivalence are very strong equivalences compared with those induced by theLogics.

### Automata on Infinite Objects

- Computer ScienceHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
- 1990

### A Metric Characterization of Fair Computations in CCS

- MathematicsTAPSOFT, Vol.1
- 1985

The problem of characterizing fair (infinite) behaviours of concurrent systems as limits of finite approximations is addressed, using Milner's Calculus of Communicating Systems as the framework.

### A Complete Inference System for a Class of Regular Behaviours

- Mathematics, Computer ScienceJ. Comput. Syst. Sci.
- 1984