A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A compositional approach to performance modelling
A compositional approach to performance modelling
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Theoretical Computer Science
Testing preorders for probabilistic processes
Information and Computation
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
IEEE Transactions on Software Engineering
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
Fault model-driven test derivation from finite state models: annotated bibliography
Modeling and verification of parallel processes
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Mutation Testing from Probabilistic Finite State Machines
TAICPART-MUTATION '07 Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for Modeling a Class of Single Timing Faults in Communication Protocols
IEEE Transactions on Computers
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
Test selection for a nondeterministic FSM
Computer Communications
Statistical model checking: an overview
RV'10 Proceedings of the First international conference on Runtime verification
Formal testing of timed and probabilistic systems
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
| Hi-index | 0.01 |
In this paper we introduce a formal framework to test systems where non-deterministic decisions are probabilistically quantified and temporal information is defined by using random variables. We define an appropriate extension of the classical finite state machines formalism, widely used in formal testing approaches, to define the systems that we are interested in. First, we define a conformance relation to establish, with respect to a given specification, what a good implementation is. In order to decide whether a system is conforming, we apply different statistic techniques to determine whether the (unknown) probabilities and random variables governing the behaviour of the implementation match the (known) ones of the specification. Next, we introduce a notion of test case. Finally, we give an alternative characterization of the previous conformance relation based on how a set of test is passed by the implementation.