36 search results - page 7 / 8 » Bisimulation Equivalence is Decidable for all Context-Free P... |
CSFW
2002
IEEE
14 years 26 days ago
2002
IEEE
We study a security property for processes in dynamic contexts, i.e., contexts that can be reconfigured at runtime. The security property that we propose in this paper, named Per...
PKC
1999
Springer
14 years 4 days ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
CONCUR
2008
Springer
13 years 9 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...
TCS
2010
13 years 6 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
NDJFL
1998
13 years 7 months ago
1998
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...