JSYML
2011
12 years 11 months 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...
TCS
2010
13 years 2 months ago
2010
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
ENTCS
2007
13 years 4 months ago
2007
d abstract) David de Frutos Escrig1 ,3 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain Carlos Gregorio Rodr´ıguez2 ,4 Depa...
ISCI
2006
13 years 4 months ago
2006
In this paper we study relations which are congruences with respect to and p, where pis the p-cut of the L-fuzzy hyperoperation . The main idea is to start from an equivalence re...
ENTCS
2008
13 years 4 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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic ...
FORTE
1990
13 years 5 months ago
1990
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
CAV
1993
Springer
13 years 8 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
KR
2004
Springer
13 years 10 months ago
2004
Springer
There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be ...