Sciweavers

1302 search results - page 134 / 261
» Fair Equivalence Relations
Sort
View
QEST
2007
IEEE
16 years 6 days ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
16 years 6 days ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
CONCUR
2007
Springer
16 years 3 days ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
DBPL
2007
Springer
83views Database» more  DBPL 2007»
16 years 3 days ago
Succinctness of Pattern-Based Schema Languages for XML
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
Wouter Gelade, Frank Neven
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 3 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson