Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Process algebra
Bisimulation through probabilistic testing
Information and Computation
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
The algebra of timed processes, ATP: theory and application
Information and Computation
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A process algebra for timed systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Testing preorders for probabilistic processes
Information and Computation
Process algebra for performance evaluation
Theoretical Computer Science
Communication and Concurrency
The theory of interactive generalized semi-Markov processes
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)
Towards Performance Evaluation with General Distributions in Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Theory of Testing for Markovian Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Acceptance Trees for Probabilistic Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
An algebraic approach to the specification of stochastic systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Denotational Semantics for Timed Testing
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Testing Semantics for a Probabilistic-Timed Process Algebra
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Stochastic Process Algebras Meet Eden
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Including Malicious Agents into a Collaborative Learning Environment
ITS '02 Proceedings of the 6th International Conference on Intelligent Tutoring 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
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Assessing the expressivity of formal specification languages
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
In this paper we present a testing theory for stochastic processes. This theory is developed to deal with processes which probability distributions are not restricted to be exponential. In order to define this testing semantics, we compute the probability with which a process passes a test before an amount of time has elapsed. Two processes will be equivalent if they return the same probabilities for any test T and any time t. The key idea consists in joining all the random variables associated with the computations that the composition of process and test may perform. The combination of the values that this random variable takes and the probabilities of executing the actions belonging to the computation will give us the desired probabilities. Finally, we relate our stochastic testing semantics with other notions of testing.