# zbMATH — the first resource for mathematics

On the minimal number of $$\times$$ operators to model regularity in fair SCCS. (English) Zbl 0676.68036
Any $$\omega$$-regular language is a weakly, strongly or strictly fair language of some strict SCCS [R. Milner, Calculi for synchrony and asynchrony, Theor. Comput. Sci. 25, 267-310 (1983; Zbl 0512.68026)] process that consists of a parallel product of exactly two inherently sequential SCCS processes.
Reviewer: R.Janicki

##### MSC:
 68Q45 Formal languages and automata 68Q70 Algebraic theory of languages and automata
##### Keywords:
regular language; SCCS processes
Full Text:
##### References:
 [1] Darondeau, P., About fair asynchrony, Theoret. comput. sci., 37, 305-336, (1985) · Zbl 0607.68016 [2] Guessarian, I.; Niar-Dinedane, W., An automaton characterization of fairness in SCCS, (), 356-372 · Zbl 0644.68036 [3] Hennessy, M., Modelling finite delay operators, Tech. rept. CSR-153-83, (1983), Edinburgh [4] Milner, R., A finite delay operator in synchronous CCS, () [5] Milner, R., Calculi for synchrony and asynchrony, Theoret. comput. sci., 25, 267-310, (1983) · Zbl 0512.68026 [6] Muller, D.E., The general synthesis problem for asynchronous digital networks, Proc. SWAT conf., 71-82, (1967) [7] Priese, L.; Rehrmann, R.; Willecke-Klemme, U., An introduction to the regular theory of fairness, Theoret. comput. sci., 54, 139-163, (1987) · Zbl 0643.68025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.