Strong fairness and ultra metrics

DOI10.1016/0304-3975(92)90175-FzbMath0769.68105WikidataQ27924892 ScholiaQ27924892MaRDI QIDQ1193893

Doris Nolte, Lutz Priese

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

logical complexityfairness conceptsultra metrics

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

A topological property of rational \(\omega\)-languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fairness and conspiracies
• Proof rules and transformations dealing with fairness
• Order and metric in the stream semantics of elemental concurrency
• About fair asynchrony
• On the minimal number of \(\times\) operators to model regularity in fair SCCS
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• A calculus of communicating systems
• Adherences of languages
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Fairness, distances and degrees
• Weak and strong fairness in CCS
• Decision problems forω-automata

This page was built for publication: Strong fairness and ultra metrics