Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
A process algebra for timed systems
Information and Computation
Handbook of logic in computer science (vol. 4)
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Discrete time process algebra: absolute time, relative time and parametric time
Fundamenta Informaticae
Time and Probability in Process Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Process Algebra with Partial Choice
CONCUR '94 Proceedings of the Concurrency Theory
Time and Probability in Process Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
| Hi-index | 0.00 |
In the paper we present an ACP-like process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extension of untimed probabilistic process algebra with constructors that allow the explicit specification of timing aspects. In this paper we concentrate on giving axioms and deduction rules for these constructors. We give two probabilistic process algebras with discrete time. The first one only manipulates with processes that may be initialized within the current time slice or may delay a finite and fixed number of time slices. Later, we add processes whose execution can be postponed for an arbitrary number of time slices.