147
click to vote
CONCUR
15 years 6 months ago
2003 Springer 
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
104
click to vote
CONCUR
15 years 6 months ago
2003 Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
CONCUR
15 years 6 months ago
2003 Springer
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.
CONCUR
15 years 6 months ago
2003 Springer 
We investigate which event structures can be denoted by means of closed CCS ∪ CSP expressions. Working up to isomorphism we find that • all denotable event structures are bund...
115
click to vote
CONCUR
15 years 6 months ago
2003 Springer 
Multi-valued model-checking is an extension of classical model-checking to reasoning about systems with uncertain information, which are common during early design stages. The addi...
|
Distributed And Parallel Computing