36 search results - page 3 / 8 » concur 2010 |
88
Voted
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
72
Voted
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We consider the problem of defining the information leakage in interactive systems where secrets and observables can alternate during the computation. We show that the in...
114
Voted
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Anonymity is a security property of paramount importance, as we move steadily towards a wired, online community. Its import touches upon subjects as different as eGovernance, eBusi...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history p...