1302 search results - page 3 / 261 » Fair Equivalence Relations |
TACAS
2005
Springer
13 years 10 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
ENTCS
2008
13 years 5 months ago
2008
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
JSYML
2011
13 years 8 days ago
2011
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
FFA
2011
13 years 9 days ago
2011
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...