Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking

Electronic Notes in Theoretical Computer Science

Volumn 220, Issue 2, 2008, Pages 35-50

  Blom, Stefan ^a   Haverkort, Boudewijn R ^a   Kuntz, Matthias ^a   van de Pol, Jaco ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Distributed bisimulation reduction; Markovian bisimulation; Stochastic model checking

Indexed keywords

CRYSTAL LATTICES; MODEL STRUCTURES; NUMERICAL ANALYSIS; SET THEORY; STOCHASTIC MODELS;

BISIMULATION; BISIMULATION REDUCTIONS; CASE STUDIES; CHECK SYSTEMS; CONTINUOUS STOCHASTIC LOGICS; DISTRIBUTED BISIMULATION REDUCTION; DISTRIBUTED SIGNATURES; EQUIVALENCE RELATIONS; LARGE SYSTEMS; MARKOVIAN; MARKOVIAN BISIMULATION; MODEL CHECKING ALGORITHMS; NUMERICAL ALGORITHMS; REALISTIC SYSTEMS; SPACE COMPLEXITIES; STATE SPACES; SUBSTANTIAL REDUCTIONS; TIME COMPLEXITIES;

MODEL CHECKING;

EID: 56849107052     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.11.012     Document Type: Article

References (25)

1. Ajmone Marsan M., Balbo G., and Conte G. A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Transactions on Computer Systems 2 (1984) 93-122
2. Aziz A., Sanwal K., Singhal V., and Brayton R.K. Verifying continuous time markov chains. In: Alur R., and Henzinger T.A. (Eds). CAV. Lecture Notes in Computer Science 1102 (1996) 269-276
3. Baier C., Haverkort B., Hermanns H., and Katoen J. Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29 (2003) 1-18
4. Blom S., and Orzan S. A distributed algorithm for strong bisimulation reduction of state spaces. International Journal on Software Tools for Technology Transfer (STTT) 7 (2005) 74-86
5. Blom S., and Orzan S. Distributed state space minimization. STTT 7 (2005) 280-291
6. Ciardo, G. and M. Tilgner, On the use of Kronecker operators for the solution of generalized stochastic Petri nets, Technical Report 96-35, ICASE (1996)
7. Clarke, E., E. Emerson and A. Sistla, Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach, in: 10th ACM Annual Symp. on Principles of Programming Languages, 1983, pp. 117-126
8. Derisavi, S., A Signature-based Algorithm for Optimal Markov Chain Lumping, in: Proceedings of the 4th International Conference on the Quantitative Evaluation of Systems (QEST 20 07), Edinburgh, UK, 20 07, pp. 259-260
9. Derisavi S., Hermanns H., and Sanders W.H. Optimal state-space lumping in Markov chains. Information Processing Letters 87 (2003) 309-315
10. Fernandez J. An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13 (1989) 219-236
11. Fujita M., McGeer P., and Yang J.-Y. Multi-terminal Binary Decision Diagrams: An efficient data structure for matrix representation. Formal Methods in System Design 10 (1997) 149-169
12. Garavel, H. and H. Hermanns, On Combining Functional Verification and Performance Evaluation Using CADP, in: FME '02: Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right (2002), pp. 410-429
13. Haverkort, B.R., H. Hermanns and J.-P. Katoen, On the Use of Model Checking Techniques for Dependability Evaluation, in: Proc. 19th IEEE Symposium on Reliable Distributed Systems (SRDS'00), Erlangen, Germany, 20 00, pp. 228-237
14. Hermanns H., Herzog U., and Katoen J.-P. Process algebra for performance evaluation. Theoretical Computer Science 274 (2002) 43-87
15. Hermanns H., Herzog U., Klehmet U., Mertsiotakis V., and Siegle M. Compositional performance modelling with the TIPPtool. Performance Evaluation 39 (2000) 5-35
16. Hermanns, H. and M. Siegle, Bisimulation Algorithms for Stochastic Process Algebras and their BDD-based Implementation, in: J.-P. Katoen, editor, ARTS'99, 5th Int. AMAST Workshop on Real-Time and Probabilistic Systems (1999), pp. 144-264
17. Hillston J. A Compositional Approach to Performance Modelling (1996), Cambridge University Press
18. Hinton A., Kwiatkowska M., Norman G., and Parker D. PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: Hermanns H., and Palsberg J. (Eds). Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. (TACAS'06). LNCS 3920 (2006) 441-444
19. Ibe O., and Trivedi K. Stochastic Petri Net Models of Polling Systems. IEEE Journal on Selected Areas in Communications 8 (1990) 1649-1657
20. Kanellakis P., and Smolka S. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation 86 (1990) 43-68
21. Katoen J.-P., Kemna T., Zapreev I., and Jansen D. Bisimulation minimisation mostly speeds up probabilistic model checking. Proc. 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. (TACAS'07). LNCS 4424 (2007) 76-92
22. Katoen, J.-P., M. Khattri and I.S. Zapreev, A Markov reward model checker, in: Quantitative Evaluation of Systems (QEST) (2005), pp. 243-244
23. Kwiatkowska M., Norman G., and Parker D. Symmetry Reduction for Probabilistic Model Checking. In: Ball T., and Jones R. (Eds). Proc. 18th International Conference on Computer Aided Verification. (CAV'06). Lecture Notes in Computer Science 4114 (2006) 234-248
24. Paige R., and Tarjan R. Three Partition Refinement Algorithms. SIAM Journal of Computing 16 (1987) 973-989
25. Sanders W.H., and Malhis L.M. Dependability evaluation using composed SAN-based reward models. Journal of Parallel and Distributed Computing 15 (1992) 238-254