On the minimal number of operators to model regularity in fair SCCS

DOI10.1016/0020-0190(88)90228-1zbMATH Open0676.68036OpenAlexW2065362100MaRDI QIDQ1122986FDOQ1122986

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

Recommendations

• scientific article
• Muller condition and fairness on multitransition systems
• An introduction to the regular theory of fairness
• scientific article
• A fixpoint approach to finite delay and fairness

zbMATH Keywords

regular languageSCCS processes

Mathematics Subject Classification ID

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

Cites Work

• Calculi for synchrony and asynchrony
• About fair asynchrony
• An introduction to the regular theory of fairness
• Title not available (Why is that?)

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122986)