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
Testing preorders for probabilistic processes
Information and Computation
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Algebraic Theory of Processes
Art of Software Testing
Process Algebra with Timing
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Semantics for Probabilistic LOTOS
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
Encoding PAMR into (Timed) EFSMs
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th 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
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Testing of symbolic-probabilistic systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Implementation Relations for the Distributed Test Architecture
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Controllable Test Cases for the Distributed Test Architecture
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Statistical Approach to Test Stochastic and Probabilistic Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Testing a probabilistic FSM using interval estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A preliminary general testing method based on genetic algorithms
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Formal testing of timed and probabilistic systems
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Customized testing for probabilistic systems
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Derivation of a suitable finite test suite for customized probabilistic systems
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Testing probabilistic distributed systems
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 5.23 |
We consider the specification and testing of systems where probabilistic information is not given by means of fixed values but as intervals of probabilities. We will use an extension of the finite state machines model where choices among transitions labelled by the same input action are probabilistically resolved. We will introduce our notion of test and we will define how tests are applied to implementations under test. We will also present implementation relations to assess the conformance, up to a level of confidence, of an implementation to a specification. In order to define these relations we will take finite samples of executions of the implementation and compare them with the probabilistic constraints imposed by the specification. Finally, we will give an algorithm for deriving sound and complete test suites.