CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
CONCUR
2010
Springer
13 years 11 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...
CONCUR
2010
Springer
13 years 11 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
13 years 11 months ago
2010
Springer
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
CONCUR
2010
Springer
13 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...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
CONCUR
2010
Springer
13 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...