ACM Transactions on Computer Systems (TOCS)
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
A compositional approach to performance modelling
A compositional approach to performance modelling
Compositional performance modelling with the TIPPtool
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Process algebra for performance evaluation
Theoretical Computer Science
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On the Use of Model Checking Techniques for Dependability Evaluation
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Optimal state-space lumping in Markov chains
Information Processing Letters
A distributed algorithm for strong bisimulation reduction of state spaces
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Distributed state space minimization
International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
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
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Stochastic Petri net models of polling systems
IEEE Journal on Selected Areas in Communications
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
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
Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
Journal of Parallel and Distributed Computing
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Hi-index | 0.00 |
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An important result of that research is the logic CSL (continuous stochastic logic) and its corresponding model checking algorithms. The evaluation of properties expressed in CSL makes it necessary to solve large systems of linear (differential) equations, usually by means of numerical analysis. Both the inherent time and space complexity of the numerical algorithms make it practically infeasible to model check systems with more than 100 million states, whereas realistic system models may have billions of states. To overcome this severe restriction, it is important to be able to replace the original state space with a probabilistically equivalent, but smaller one. The most prominent equivalence relation is bisimulation, for which also a stochastic variant exists (Markovian bisimulation). In many cases, this bisimulation allows for a substantial reduction of the state space size. But, these savings in space come at the cost of an increased time complexity. Therefore in this paper a new distributed signature-based algorithm for the computation of the bisimulation quotient of a given state space is introduced. To demonstrate the feasibility of our approach in both a sequential, and more important, in a distributed setting, we have performed a number of case studies.