Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Additive models of probabilistic processes
Theoretical Computer Science
A Theory of Testing for Markovian Processes
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
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
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
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
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 0.00 |