Well (and better) quasi-ordered transition systems

Bulletin of Symbolic Logic

Volumn 16, Issue 4, 2010, Pages 457-515

  Parosh, Aziz ABDULLA ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78951490577     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1294171129     Document Type: Article

References (38)

1. th IEEE International Symposium on Logic in Computer Science, 1996, pp. 313-321.
2. -, Algorithmic analysis of programs with well quasi-ordered domains, Information and Computation, vol. 160 (2000), pp. 109-127.
3. th International Workshop on on Automated Verification of Infinite-State Systems, 2006.
4. th IEEE International Symposium on Logic in Computer Science, 1993, pp. 160-170.
5. -, Verifying programs with unreliable channels, Information and Computation, vol. 127 (1996), no. 2, pp. 91-101.
6. th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Bernhard Steffen, editor), Lecture Notes in Computer Science, vol. 1384, 1998, pp. 298-312.
7. -, Ensuring completeness of symbolic verification methods for infinite-state systems, Theoretical Computer Science, vol. 256 (2001), pp. 145-167.
8. -, Model checking of systems with many identical timed processes, Theoretical Computer Science, vol. 290 (2003), no. 1, pp. 241-264.
9. th IEEE International Symposium on Logic in Computer Science, 2000, pp. 132-140.
10. -, Timed Petri nets and BQOs, Proceedings on the ICATPN'2001: 22nd International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, vol. 2075, 2001, pp. 53-70.
11. th IEEE International Symposium on Logic in Computer Science, 1990, pp. 414-425.
12. R. ALUR and D. DILL, A theory of timed automata. Theoretical Computer Science, vol. 126 (1994), pp. 183-235.
13. K. BARTLETT, R. SCANTLEBURY, and P. WILKINSON, A note on reliable full-duplex transmissions over half duplex lines, Communications of the ACM, vol. 12 (1969), no. 5, pp. 260-261.
14. th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 1999.
15. P. BOUYER, Forward analysis of updatable timed automata, Formal Methods in System Design, vol. 24 (2004), no. 3, pp. 281-320.
16. R. E. BRYANT, Graph-based algorithms for boolean function manipulation, IEEE Transactions on Computers, vol. C-35 (1986), no. 8, pp. 677-691.
17. 20 states and beyond, Information and Computation, vol. 98 (1992), pp. 142-170.
18. K. ČERANS, Deciding properties of integral relational automata, Proceedings of the ICA LP '94, 21" International Colloquium on Automata, Languages, and Programming ( Abiteboul and Shamir, editors), Lecture Notes in Computer Science, vol. 820, Springer Verlag, 1994, pp. 35-46.
19. E. M. CLARKE, E. A. EMERSON, and A. P. SISTLA, Automatic verification of finite-state concurrent systems using temporal logic specification, ACM Transactions on Programming Languages and Systems, vol. 8 (1986), no. 2, pp. 244-263.
20. T. CORMEN, C. LEISERSON, R. RWEST, and C. STEIN, Introduction to algorithms, MIT Press, McGraw-Hill, 2001.
21. G. DELZANNO, Automatic verification of cache coherence protocols, Proceedings of the 12'h International Conference on Computer Aided Verification (Emerson and Sistla, editors), Lecture Notes in Computer Science, vol. 1855, Springer Verlag, 2000, pp. 53-68.
22. L. E. DICKSON, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, American Journal of Mathematics, vol. 35 (1913), pp. 413-422.
23. th IEEE International Symposium on Logic in Computer Science, 1999.
24. th International Colloquium on Automata, Languages, and Programming, 1987, pp. 499-508.
25. -, Decidability of the termination problem for completely specified protocols. Distributed Computing, vol. 7 (1994), no. 3, pp. 129-135.
26. A. FINKEL and PH. SCHNOEBELEN, Well-structured transition systems everywhere!, Theoretical Computer Science, vol. 256 (2001), no. 1-2, pp. 63-92.
27. G. HIGMAN, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society (3), vol. 2 (1952), no. 7, pp. 326-336.
28. 2-well quasi-orderings and reachability analysis. Technical Report 158, Department of Computing Systems, Uppsala University, 1999.
29. K. G. LARSEN, P. PETTERSSON, and W. YI, UPPAAL in a nutshell, International Journal on Software Tools for Technology Transfer, vol. 1 (1997), no. 1-2.
30. R. LAZIC, T. NEWCOMB, J. OUAKNINE, A. W. ROSCOE, and J. WORRELL, Nets with tokens which carry data, Fundamentals of Information, (2008), no. 3, pp. 251-274.
31. A. MARCONE, Fine and axiomatic analysis of the quasi-orderings on P(q), Technical Report 17/99/RR, Rapporto di Ricerca del Dipartimento di Matematica e Informatica dell'Università di Udine, 1999.
32. K. L. MCMILLAN, Symbolic model checking, Kluwer Academic Publishers, 1993.
33. E. C. MILNER, Basic wqo- and bqo-theory, Graphs and orders (I. Rival, editor), D. Reidel Publishing Company, 1985, pp. 487-502.
34. P. NIEBERT, M. MAHFOUDH, E. ASARIN, M. BOZGA, N. JAIN, and O. MALER, Verification of timed automata via satisfiability checking, FTRTFT'02, 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems, vol. 2469, 2002, pp. 225-243.
35. M. POUZET, Applications of well quasi-orderings and better quasi-orderings, Graphs and orders (I. Rival, editor), D. Reidel Publishing Company, 1985, pp. 503-519.
36. J. P. QUEILLE and J. SIFAKIS, Specification and verification of concurrent systems in Cesar, 5th International Symposium on Programming, Turin, Lecture Notes in Computer Science, vol. 137, Springer Verlag, 1982, pp. 337-352.
37. P. REVESZ, Introduction to constraint databases, Springer, 2002.
38. S. YOVTNE, Kronos: A verification tool for real-time systems, International Journal on Software Tools for Technology Transfer, vol. 1 (1997), no. 1-2.