On the minimisation of acyclic models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5201 LNCS, Issue , 2008, Pages 295-309

  Crouzen, Pepijn ^a   Hermanns, Holger ^a,b   Zhang, Lijun ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN FUNCTIONS; CONTINUOUS TIME SYSTEMS; DYNAMIC ANALYSIS; INFORMATION THEORY; MODEL CHECKING;

BISIMULATION MINIMISATION; CASE STUDIES; COMPOSITIONAL SEMANTICS; CONTINUOUS-TIME; DYNAMIC FAULT TREES; EFFICIENT; INPUT MODELS; INTERACTIVE MARKOV CHAINS; LABELLED TRANSITION SYSTEMS; MARKOV CHAINS; MODELLING; NOVEL ALGORITHMS; WEAK BISIMULATION;

MARKOV PROCESSES;

EID: 54249163403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_25     Document Type: Conference Paper

References (25)

1. Blom, S., Fokkink, W., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: μcrl: A toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250-254. Springer, Heidelberg (2001)
2. Blom, S., Orzan, S.: Distributed branching bisimulation reduction of state spaces. Electr. Notes Theor. Comput. Sci. 89(1) (2003)
3. Böde, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Wimmer, R., Becker, B.: Compositional performability evaluation for statemate. In: QEST, pp. 167-178 (2006)
4. Boudali, H., Crouzen, P., Stoelinga, M.: A compositional semantics for dynamic fault trees in input/output interactive markov chains. In: ATVA, pp. 441-456 (2007)
5. Bravetti, M.: Revisiting interactive markov chains. Electronic Notes in Theoretical Computer Science 68(5) (2002)
6. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: ACM Symposium on Theory of Computing (1987)
7. Coste, N., Garavel, H., Hermanns, H., Hersemeule, R., Thonnart, Y., Zidouni, M.: Quantitative evaluation in embedded system design: Validation of multiprocessor multithreaded architectures. In: DATE (2008)
8. Crouzen, P., Hermanns, H., Zhang, L.: No Cycling? Go Faster! On the minimization of acyclic models. Reports of SFB/TR 14 AVACS 41, SFB/TR 14 AVACS (July 2008), http://www.avacs.org ISSN: 1860-9821
9. Dovier, A., Piazza, C., Policriti, A.: A fast bisimulation algorithm. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 79-90. Springer, Heidelberg (2001)
10. Dugan, J., Bavuso, S., Boyd, M.: Dynamic fault-tree models for fault-tolerant computer systems. IEEE Transactions on Reliability 41(3), 363-377 (1992)
11. Fokkink, W., Pang, J., van de Pol, J.: Cones and foci: A mechanical framework for protocol verification. Formal Methods in System Design 29(1), 1-31 (2006)
12. Garavel, H., Lang, F., Mateescu, R., Serwe, W.: Cadp 2006: A toolbox for the construction and analysis of distributed processes. In: CAV (2006)
13. Goralcikova, A., Koubek, V.: A reduct-and-closure algorithm for graphs. Mathematical Foundations of Computer Science 74, 301-307 (1979)
14. Griffoen, W.O.D., Vaandrager, F.W.: A theory of normed simulations. ACM Trans. Comput. Log. 5(4), 577-610 (2004)
15. Groote, J.F., Vaandrager, F.: An effcient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443. Springer, Heidelberg (1990)
16. Hermanns, H.: Interactive Markov Chains: The Quest for Quantified Quality. LNCS, vol. 2428. Springer, Heidelberg (2002)
17. Katoen, J.-P., Kemna, T., Zapreev, I.S., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 87-101. Springer, Heidelberg (2007)
18. Lang, F.: Refined interfaces for compositional verification. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 159-174. Springer, Heidelberg (2006)
19. Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI Quarterly 2(3), 219-246 (1989)
20. Mateescu, R.: Local model-checking of modal mu-calculus on acyclic labeled transition systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 281-295. Springer, Heidelberg (2002)
21. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
22. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973-989 (1987)
23. Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 376-386. Springer, Heidelberg (1986)
24. Vesely, W., Goldberg, F., Roberts, N., Haasl, D.: Fault Tree Handbook. NASA (1981)
25. Wimmer, R., Herbstritt, M., Hermanns, H., Strampp, K., Becker, B.: Sigref - a symbolic bisimulation tool box. In: ATVA, pp. 477-492 (2006)