3122 search results - page 9 / 625 » A Theory of Network Equivalence |
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
—In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource ...
67
Voted
IJAC
2006
14 years 9 months ago
2006
: It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this...
EPIA
2005
Springer
15 years 3 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
72
Voted
ENTCS
2006
14 years 9 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...