Symbolic implementation of alternating automata

International Journal of Foundations of Computer Science

Volumn 18, Issue 4, 2007, Pages 727-743

  Bloem, Roderick ^a   Cimatti, Alessandro ^b   Pill, Ingo ^a   Roveri, Marco ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b FONDAZIONE BRUNO KESSLER   (Italy)

Author keywords

Alternation; B chi automata; Fair transition system; Formal verification; Model checking; Symbolic methods

Indexed keywords

EID: 34547505100     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107004942     Document Type: Article

References (22)

1. IEEE-Commission: IEEE standard for Property Specification Language (PSL) (2005) IEEE Std 1850-2005.
2. Armoni, R., et al.: The ForSpec temporal logic: A new temporal property-specification language. In: International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'02). (2002) 296-311
3. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. Logic in Computer Science. (1986) 322-331
4. Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Twelfth Conference on Computer Aided Verification (CAV'00). (2000) 248-263
5. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Conference on Computer Aided Verification (CAV '01). (2001) 53-65
6. Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification, Testing, and Verification. Chapman & Hall (1995) 3-18
7. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science. (1990) 428-439
8. Clarke, E.M., Grumberg, O., Hamaguchi, K.: Another look at LTL model checking. Formal Methods in System Design (1) (1997) 47-71
9. Ben-David, S., Bloem, R., Fisman, D., Griesmayer, A., Pill, I., Ruah, S.: Automata construction algorithms optimized for PSL. http://www.prosyd.org (2005) Prosyd D 3.2/4.
10. Miyano, S., Hayashi, T.: Alternating finite automata on ω-words. Theoretical Computer Science 32 (1984) 321-330
11. Bloem, R., Cimatti, A., Pill, I., Roveri, M., Semprini, S.: Symbolic implementation of alternating automata. In: Conference on Implementation and Application of Automata (CIAA '06). (2006) LNCS 4094.
12. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28(1) (1981) 114-133
13. Muller, D., Saoudi, A., Schupp, P.: Alternating automata, the weak monadic theory of the tree, and its complexity. In: International Colloquium on Automata, Languages and Programming on Automata, languages and programming, New York, NY, USA, Springer-Verlag New York, Inc. (1986) 275-283
14. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer Verlag, New York (1992)
15. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic 2(3) (2001) 408-429
16. Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new Symbolic Model Verifier. In: Conference on Computer-Aided Verification. (1999) 495-499
17. Heljanko, K., Junttila, T.A., Latvala, T.: Incremental and complete bounded model checking for full PLTL. In: Computer Aided Verification (CAV'05). (2005) 98-111
18. Eén, N., Sörensson, N.: MiniSAT (2005) http://www.cs. chalmers.se/Cs/Research/FormalMethods/MiniSat/Main.html.
19. Heljanko, K., Junttila, T., Keinänen, M., Lange, M., Latvala, T.: Bounded Model Checking for Weak Alternating Büchi Automata. In: Proc. of the 18th Int. Conf. on Computer Aided Verification, CAV'06. Volume 4144 of LNCS., Seattle (USA) (2006) 95-108
20. David, S.B., Orni, A.: Property-by-Example guide: a handbook of PSL/Sugar examples - PROSYD deliverable d1.1/3. http://www.prosyd.org (2005)
21. Fritz, C.: Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In: Conference on Implementation and Application of Automata. (2003) 35-48 LNCS 2759.
22. Fritz, C., Wilke, T.: Simulation relations for alternating Büchi automata. Theoretical Computer Science 338 (2005) 275-314