CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computat...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
The concept of invariance for Parameterised Boolean Equation Systems (PBESs) is studied in greater detail. We identify an issue with the associated theory and fix this problem by p...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every s...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
ion for Stochastic Systems by Erlang's Method of Stages Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 1 RWTH Aachen University 2 TU Munich 3 EPF La...