Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Additive models of probabilistic processes
Theoretical Computer Science
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Theory of Testing for Markovian Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
An Axiomatization of Probabilistic Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Fully Abstract Characterization of Probabilistic May Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
| Hi-index | 0.00 |