A Short Visit to the STS Hierarchy

Electronic Notes in Theoretical Computer Science

Volumn 154, Issue 3, 2006, Pages 59-69

  Bertrand, Nathalie ^a   Schnoebelen, Philippe ^a  

^a CNRS   (France)

Author keywords

STS hierarchy; Symbolic transition systems; well structured transition systems

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER AIDED SOFTWARE ENGINEERING; MATHEMATICAL MODELS;

STS HIERARCHY; SYMBOLIC TRANSITION SYSTEMS; WELL-STRUCTURED TRANSITION SYSTEMS;

HIERARCHICAL SYSTEMS;

EID: 33745848500     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.05.007     Document Type: Article

References (15)

1. Abdulla P.A., Čerāns K., Jonsson B., and Tsay Y.-K. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160 1/2 (2000) 109-127
2. Abdulla P.A., and Jonsson B. Verifying programs with unreliable channels. Information and Computation 127 2 (1996) 91-101
3. Bukart O., Caucal D., Moller F., and Steffen B. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). Verification on infinite structures. Handbook of Process Algebra (2001), Elsevier Science 545-623 chapter 9
4. Bouajjani A., Esparza J., Finkel A., Maler O., Rossmanith P., Willems B., and Wolper P. An efficient automata approach to some problems on context-free grammars. Information Processing Letters 74 5-6 (2000) 221-227
5. Bertrand N., and Schnoebelen Ph. Model checking lossy channels systems is probably decidable. Proc. 6th Int. Conf. Foundations of Software Science and Computation Structures. (FOSSACS 2003), Warsaw, Poland, Apr. 2003. Lecture Notes in Computer Science volume 2620 (2003), Springer 120-135
6. Caucal D. On the regular structure of prefix rewriting. Theoretical Computer Science 106 1 (1992) 61-86
7. Cécé G., Finkel A., and Purushothaman Iyer S. Unreliable channels are easier to verify than perfect channels. Information and Computation 124 1 (1996) 20-31
8. Dickson L.E. Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Amer. Journal Math. 35 (1913) 413-422
9. Esparza J. Decidability and complexity of Petri net problems - an introduction. Advances in Petri Nets 1998. Lecture Notes in Computer Science volume 1491 (1998), Springer 374-428
10. Finkel A. A generalization of the procedure of Karp and Miller to well structured transition systems. Proc. 14th Int. Coll. Automata, Languages, and Programming. (ICALP '87), Karlsruhe, FRG, July 1987. Lecture Notes in Computer Science volume 267 (1987), Springer 499-508
11. Finkel A. Decidability of the termination problem for completely specified protocols. Distributed Computing 7 3 (1994) 129-135
12. Finkel A., and Schnoebelen Ph. Well-structured transition systems everywhere!. Theoretical Computer Science 256 1-2 (2001) 63-92
13. van Glabbeek R.J. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). The linear time - branching time spectrum I. Handbook of Process Algebra (2001), Elsevier Science 3-99 chapter 1
14. Higman G. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2 7 (1952) 326-336
15. Henzinger T.A., Majumdar R., and Raskin J.-F. A classification of symbolic transition systems. ACM Trans. Computational Logic 6 1 (2005) 1-32