Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Process algebra
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Testing preorders for probabilistic processes
Information and Computation
An Efficient Algorithm for Aggregating PEPA Models
IEEE Transactions on Software Engineering
Communication and Concurrency
Handbook of Process Algebra
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Optimal state-space lumping in Markov chains
Information Processing Letters
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Mathematical Structures in Computer Science
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
From annotated software designs (UML SPT/MARTE) to model formalisms
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
From Biochemistry to Stochastic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches to their definition: bisimilarity, testing, and trace. In this paper we survey the major results appeared in the literature about Markovian bisimilarity, Markovian testing equivalence, and Markovian trace equivalence. The objective is to compare these equivalences with respect to a number of criteria such as their discriminating power, the exactness of the CTMC-level aggregations they induce, the achievement of the congruence property, the existence of sound and complete axiomatizations, the existence of logical characterizations, and the existence of efficient verification algorithms.