Fairness and regularity for SCCS processes

DOI10.1051/ita/1989230100591zbMath0665.68019OpenAlexW4301167103MaRDI QIDQ3816967

Irène Guessarian, Wafaa Niar-Dinedane

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92324

zbMATH Keywords

SCCSoperational semanticsMuller automataomega-regular languagesfair languagessynchronous communicating sequential processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items

Muller condition and fairness on multitransition systems

Cites Work

• Calculi for synchrony and asynchrony
• Axiomatising finite delay operators
• A complete inference system for a class of regular behaviours
• About fair asynchrony
• An introduction to the regular theory of fairness
• Appraising fairness in languages for distributed programming
• On the minimal number of \(\times\) operators to model regularity in fair SCCS
• A calculus of communicating systems
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• An algebraic characterization of transition system equivalences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item