A compositional approach to performance modelling
A compositional approach to performance modelling
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Acceptance Trees for Probabilistic Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Theory of Efficiency for Markovian Processes
A Theory of Efficiency for Markovian Processes
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Probabilistic i/o automata: theories of two equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Compositional reasoning for markov decision processes
FSEN'11 Proceedings of the 4th IPM 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 |
We present a testing theory for Markovian processes in order to formalize a notion of efficiency which may be useful for the analysis of soft real time systems. Our Markovian testing theory is shown to enjoy close connections with the classical testing theory of De Nicola-Hennessy and the probabilistic testing theory of Cleaveland-Smolka et al. The Markovian testing equivalence is also shown to be coarser than the Markovian bisimulation equivalence. A fully abstract characterization is developed to ease the task of establishing testing related relationships between Markovian processes. It is then demonstrated that our Markovian testing equivalence, which is based on the (easier to work with) probability of executing a successful computation whose average duration is not greater than a given amount of time, coincides with the Markovian testing equivalence based on the (more intuitive) probability of reaching success within a given amount of time. Finally, it is shown that it is not possible to define a Markovian preorder which is consistent with reward based performance measures, thus justifying why a generic notion of efficiency has been considered.