On the minimal number of \(\times\) operators to model regularity in fair SCCS

DOI10.1016/0020-0190(88)90228-1zbMath0676.68036OpenAlexW2065362100MaRDI QIDQ1122986

Lutz Priese, Irène Guessarian

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90228-1

zbMATH Keywords

regular languageSCCS processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Fairness and regularity for SCCS processes ⋮ Strong fairness and ultra metrics

Cites Work

• Unnamed Item
• Calculi for synchrony and asynchrony
• About fair asynchrony
• An introduction to the regular theory of fairness

This page was built for publication: On the minimal number of \(\times\) operators to model regularity in fair SCCS