A note on well quasi-orderings for powersets

Information Processing Letters

Volumn 72, Issue 5-6, 1999, Pages 155-160

  Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Powersets; Theory of computation; Well quasi orderings

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; PROBLEM SOLVING;

INFINITE-STATE SYSTEMS; WELL QUASI-ORDERINGS;

INFORMATION THEORY;

EID: 0033459452     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00149-0     Document Type: Article

References (6)

1. P.A. Abdulla, K. Čerāns, B. Jonsson, T. Yih-Kuen, General decidability theorems for infinite-state systems, in: Proc. 11th IEEE Internat. Symp. on Logic in Computer Science, 1996, pp. 313-321. (To appear in Information and Computation.)
2. P.A. Abdulla, B. Jonsson, Verifying networks of timed processes, in: Proc. 7th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), Lecture Notes in Computer Sci., Vol. 1384, Springer, Berlin, 1998, pp. 298-312.
3. P.A. Abdulla, B. Jonsson, Ensuring completeness of symbolic verification methods for infinite-state systems, Theoret. Comput. Sci., to appear.
4. A. Finkel, Ph. Schnoebelen, Fundamental structures in well-structured infinite transition systems, in: Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), Lecture Notes in Computer Sci., Vol. 1380, Springer, Berlin, 1998, pp. 102-118.
5. A. Marcone, Foundations of bqo theory, Trans. Amer. Math. Soc. 345 (2) (1994) 641-660.
6. B.C. Milner, Basic wqo- and bqo-theory, in: I. Rival (Ed.), Graphs and Orders, D. Reidel Publishing Company, Dordrecht, 1985, pp. 487-502.