1679 search results - page 51 / 336 » Strong order equivalence |
146
click to vote
CTCS
1997
Springer
15 years 10 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
124
click to vote
MFCS
1993
Springer
15 years 9 months ago
1993
Springer
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
154
click to vote
CONCUR
1995
Springer
15 years 9 months ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
136
click to vote
DM
2010
15 years 5 months ago
2010
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
160
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...