Sciweavers

276 search results - page 47 / 56
» Bisimulation for quantum processes
Sort
View
CN
2006
117views more  CN 2006»
13 years 9 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
ENTCS
2006
134views more  ENTCS 2006»
13 years 9 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
IJFCS
2008
130views more  IJFCS 2008»
13 years 9 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
FSEN
2009
Springer
14 years 3 months ago
A Timed Calculus for Wireless Systems
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
Massimo Merro, Eleonora Sibilio
CONCUR
2001
Springer
14 years 1 months ago
CCS with Priority Guards
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Va...
Iain Phillips