Sciweavers

290 search results - page 49 / 58
» Congruence for Structural Congruences
Sort
View
IANDC
2006
121views more  IANDC 2006»
13 years 7 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 8 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
FOSSACS
2009
Springer
14 years 2 months ago
Reactive Systems, Barbed Semantics, and the Mobile Ambients
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
Filippo Bonchi, Fabio Gadducci, Giacoma Valentina ...
IEEECGIV
2008
IEEE
14 years 1 months ago
An Approach to the Feature-Based Comparisons for the Rational Curves
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
Chanon Aphirukmatakun, Natasha Dejdumrong
CSL
2007
Springer
14 years 1 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy