A. Aldini, M. Bernardo & F. Corradini (2010):
A Process Algebraic Approach to Software Architecture Design.
Springer,
doi:10.1007/978-1-84800-223-4.
J.C.M. Baeten, J.A. Bergstra & S.A. Smolka (1995):
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities.
Information and Computation 121,
pp. 234–255,
doi:10.1006/inco.1995.1135.
C. Baier, J.-P. Katoen, H. Hermanns & V. Wolf (2005):
Comparative Branching-Time Semantics for Markov Chains.
Information and Computation 200,
pp. 149–214,
doi:10.1016/j.ic.2005.03.001.
M. Bernardo, R. De Nicola & M. Loreti (2010):
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes.
In: Proc. of the 5th Int. Symp. on Trustworthy Global Computing (TGC 2010),
LNCS 6084.
Springer,
pp. 35–56,
doi:10.1007/978-3-642-15640-3.
M. Bernardo, R. De Nicola & M. Loreti (2011):
A Uniform Framework for Process Models and Behavioral Equivalences of Nondeterministic, Probabilistic, Stochastic, or Mixed Nature.
Submitted for journal publication.
S.D. Brookes, C.A.R. Hoare & A.W. Roscoe (1984):
A Theory of Communicating Sequential Processes.
Journal of the ACM 31,
pp. 560–599,
doi:10.1145/828.833.
R. De Nicola & M. Hennessy (1984):
Testing Equivalences for Processes.
Theoretical Computer Science 34,
pp. 83–133,
doi:10.1016/0304-3975(84)90113-0.
R. De Nicola, D. Latella, M. Loreti & M. Massink (2009):
On a Uniform Framework for the Definition of Stochastic Process Languages.
In: Proc. of the 14th Int. Workshop on Formal Methods for Industrial Critical Systems (FMICS 2009),
LNCS 5825.
Springer,
pp. 9–25,
doi:10.1007/978-3-642-04570-7_2.
R. De Nicola, D. Latella, M. Loreti & M. Massink (2009):
Rate-Based Transition Systems for Stochastic Process Calculi.
In: Proc. of the 36th Int. Coll. on Automata, Languages and Programming (ICALP 2009),
LNCS 5556.
Springer,
pp. 435–446,
doi:10.1007/978-3-642-02930-1_36.
R.J. van Glabbeek (2001):
The Linear Time – Branching Time Spectrum I.
In: Handbook of Process Algebra.
Elsevier,
pp. 3–99,
doi:10.1007/BFb0039066.
M. Hennessy & R. Milner (1985):
Algebraic Laws for Nondeterminism and Concurrency.
Journal of the ACM 32,
pp. 137–162,
doi:10.1145/2455.2460.
H. Hermanns (2002):
Interactive Markov Chains.
Springer,
doi:10.1007/3-540-45804-2.
Volume 2428 of LNCS.
J. Hillston (1996):
A Compositional Approach to Performance Modelling.
Cambridge University Press,
doi:10.1017/CBO9780511569951.
C.-C. Jou & S.A. Smolka (1990):
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.
In: Proc. of the 1st Int. Conf. on Concurrency Theory (CONCUR 1990),
LNCS 458.
Springer,
pp. 367–383,
doi:10.1007/BFb0039071.
R.M. Keller (1976):
Formal Verification of Parallel Programs.
Communications of the ACM 19,
pp. 371–384,
doi:10.1145/360248.360251.
K. Seidel (1995):
Probabilistic Communicating Processes.
Theoretical Computer Science 152,
pp. 219–249,
doi:10.1016/0304-3975(94)00286-0.