Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Testing preorders for probabilistic processes
Information and Computation
Distribution functions of probabilistic automata
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Domain Theory in Stochastic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising Testing Preorders for Finite Probabilistic Processes
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Probabilistic verification for “black-box” systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
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
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.01 |
We introduce a notion of finite testing, based on statistical hypothesis tests, via a variant of the well-known trace machine. Under this scenario, two processes are deemed observationally equivalent if they cannot be distinguished by any finite test. We consider processes modeled as image finite probabilistic automata and prove that our notion of observational equivalence coincides with the trace distribution equivalence proposed by Segala. Along the way, we give an explicit characterization of the set of probabilistic generalize the Approximation Induction Principle by defining an also prove limit and convex closure properties of trace distributions in an appropriate metric space.