CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
We propose how to present and compute a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Theories identifying well-formed systems of processes—those that are free of communication errors and enjoy strong properties such as deadlock freedom—are based either on sessi...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Several programming constructs have recently been proposed with the purpose of enabling the programmer to encode declassifying information flows within a program that complies wi...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preord...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...