Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
An algebraic theory of fair asynchronous communicating processes
Theoretical Computer Science
Algebraic theory of processes
Process algebra
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
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
Handbook of Process Algebra
Testing preorders for probabilistic processes can be characterized by simulations
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
Fair Testing through Probabilistic Testing
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Acceptance Trees for Probabilistic Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Infinite Probabilistic and Nonprobabilistic Testing
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
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 processes
Journal of the ACM (JACM)
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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.00 |
We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passinga test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive(sequential tests), generative(branching tests), and limited generative(equitable branching tests). For each of these families we define three predicates over processes and tests (may-pass, must-pass,passp) which induce three equivalences. Finally, we relate these nine equivalences and provide either alternative characterizations or fully abstract denotational semantics. These semantic frameworks cover from simple traces to probabilistic acceptance trees.