Minimization of non-deterministic automata with large alphabets

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

Volumn 3845 LNCS, Issue , 2006, Pages 31-42

  Abdulla, Parosh Aziz ^a   Deneux, Johann ^a   Kaati, Lisa ^a   Nilsson, Marcus ^a  

^a Dept of Information Technology ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; OPTIMIZATION; PROBLEM SOLVING; SOFTWARE PROTOTYPING;

BINARY DECISION DIAGRAMS (BDDS); NON-DETERMINISTIC AUTOMATA; PROTOTYPE IMPLEMENTATION;

AUTOMATA THEORY;

EID: 33745173081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_3     Document Type: Conference Paper

References (22)

1. th Int. Conf. on Computer Aided Verification. Volume 1427 of Lecture Notes in Computer Science., Springer Verlag (1998) 500-504
2. th Int. Conf. on Computer Aided Verification. Volume 1102 of Lecture Notes in Computer Science., Springer Verlag (1996) 394-397
3. Fernandez, J.C., Garavel, H., Kerbrat, A., Mateescu, R., Mounier, L., Sighireanu, M.: CADP: A Protocol Validation and Verification Toolbox. In: CAV'96, LNCS 1102 (1996)
4. th Int. Conf. on Concurrency Theory. (2004) 348-360
5. th Int. Conf. on Computer Aided Verification. Volume 2725 of Lecture Notes in Computer Science. (2003) 236-248
6. Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In Kohavi, Z., ed.: The Theory of Machines and Computations. Academic Press (1971) 189-196
7. Paige, R., Tarjan, R., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science 40 (1985) 67-84
8. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing 16 (1987) 973-989
9. Holzmann, G.: Design and Validation of Computer Protocols. Prentice Hall (1991)
10. Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science 311 (2004) 221-256
11. Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans, on Computers C-35 (1986) 677-691
12. Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. In: ICCAD '93: Proc. of the 1993 IEEE/ACM international conference on Computer-aided design, IEEE Computer Society Press (1993) 188-191
13. Fernandez, J.C.: An implementation of an efficient algorithm for bisimulation equivalence. Sci. Comput. Program. 13 (1989)
14. Bouali, A., de Simone, R.: Symbolic bisimulation minimisation. In: Proc, Workshop on Computer Aided Verification. Volume 663 of Lecture Notes in Computer Science. (1992) 96-108
15. Klarlund, N.: An n log n algorithm for online bdd refinement. J. Algorithms 32 (1999) 133-154
16. Fisler, K., Vardi, M.Y.: Bisimulation and model checking. In: Conference on Correct Hardware Design and Verification Methods. (1999) 338-341
17. Bouajjani, A., Fernandez, J., Halbwachs, N.: Minimal model generation (1990) Manuscript.
18. th ACM Symp. on Theory of Computing. (1992)
19. Andersen, H.R.: An introduction to binary decision diagrams. Technical Report DK-2800, Department of Information Technology, Technical University of Denmark (1998)
20. Somenzi, F.: Binary decision diagrams (1999)
21. Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems 15 (1993)
22. Kanellakis, P., Smolka, S.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86 (1990) 43-68