Self-adjusting binary search trees
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
Bisimulation through probabilistic testing
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Communication and Concurrency
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
Aggregation Methods for Large Markov Chains
Proceedings of the International Workshop on Computer Performance and Reliability
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
Model checking meets performance evaluation
ACM SIGMETRICS Performance Evaluation Review
Comparative branching-time semantics for Markov chains
Information and Computation
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Effective Minimization of Acyclic Phase-Type Representations
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Reflection symmetry detection to reduce the state space of Markovian models
Proceedings of the 47th Annual Southeast Regional Conference
Probabilistic Reachability for Parametric Markov Models
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A symbolic algorithm for optimal Markov chain lumping
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Abstraction of probabilistic systems
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Performance evaluation and model checking join forces
Communications of the ACM
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Lumping partially symmetrical stochastic models
Performance Evaluation
Probabilistic Logical Characterization
Information and Computation
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Synthesis for PCTL in parametric Markov decision processes
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Stochastic Petri net models of Ca2+ signaling complexes and their analysis
Natural Computing: an international journal
PARAM: a model checker for parametric markov models
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Scaling probabilistic timing verification of hardware using abstractions in design source code
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Correctness issues of symbolic bisimulation computation for markov chains
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Simple O(m log n) time Markov chain lumping
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Belief bisimulation for hidden markov models: logical characterisation and decision algorithm
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Weighted lumpability on markov chains
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Tackling continuous state-space explosion in a Markovian process algebra
Theoretical Computer Science
| Hi-index | 0.91 |
We prove that the optimal lumping quotient of a finite Markov chain can be constructed in O(mlg n) time, where n is the number of states and m is the number of transitions. Our proof relies on the use of splay trees (designed by Sleator and Tarjan [J. ACM 32 (3) (1985) 652-686]) to sort transition weights.