Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Verification of multiprocess probabilistic protocols
Distributed Computing
Observation equivalence as a testing equivalence
Theoretical Computer Science
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Proof System for Hennessy-Milner Logic with Recursion
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
Coin Lemmas with Random Variables
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Time and Probability in Process Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
Compositional information flow security for concurrent programs
Journal of Computer Security
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Performance Evaluation
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Statistical model checking for networks of priced timed automata
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Models for contract conformance
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Measuring information flow in reactive processes
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Lumpability abstractions of rule-based systems
Theoretical Computer Science
Weighted probabilistic equivalence preserves ω-regular properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Comparing Refinements for Failure and Bisimulation Semantics
Fundamenta Informaticae
On the semantics of Markov automata
Information and Computation
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.00 |
We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm with a probability arbitrary close to 1 can distinguish processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called 2/3-bisimulation — lying strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language is shown to identify an even stronger process relation, called probabilistic bisimulation.