Well-abstracted transition systems

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

Volumn 1877 LNCS, Issue , 2000, Pages 566-581

  Finkel, Alain ^a   Iyer, Purushothaman ^b   Sutre, Gregoire ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; FORMAL METHODS;

ARBITRARY NUMBER; EXECUTION SEQUENCES; INFINITE STATE SYSTEMS; REGULAR EXPRESSIONS; SEMILINEAR; SYMBOLIC REPRESENTATION; TRANSITION SYSTEM;

ITERATIVE METHODS;

EID: 84885197083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_40     Document Type: Conference Paper

References (15)

1. P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. Lecture Notes in Computer Science, 1579: 208-222, 1999.
2. 20 states and beyond. Information and Computation, 98(2): 142-170, June 1992.
3. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. 4th Int. Symp. Static Analysis, Paris, France, September 1997, Volume 1302, pages 172-186. Springer-Verlag, 1997.
4. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations. In Proc. 24th Int. Coll. Automata, Languages, and Programming (ICALP'97), Bologna, Italy, July 1997, Volume 1256 of Lecture Notes in Computer Science, pages 560-570. Springer-Verlag, 1997.
5. Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4): 481-494, October 1964.
6. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2): 323-342, April 1983.
7. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual Symposium on Principles of Programming Languages, pages 238-252. ACM SIGACT and SIGPLAN, ACM Press, 1977.
8. G. Cécé. Vérification, analyse et approximations symboliques des automates communicants. Thèse ENS de Cachan, January 1998.
9. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV'98), Vancouver, BC, Canada, June-July 1998, volume 1427 of Lecture Notes in Computer Science, pages 268-279. Springer, 1998.
10. A. Finkel, S. P. Iyer, and G. Sutre. Well-abstracted transition systems: application to fifo automata. Research Report LSV-2000-6, Lab. Specification and Verification, ENS de Cachan, Cachan, France, June 2000.
11. A. Finkel and O. Marcé. A minimal symbolic coverability graph for infinite-state comunicating automata. Technical report, LIFAC, 1996.
12. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb. 2000, Volume 1770 of Lecture Notes in Computer Science, pages 346-357. Springer, 2000.
13. Thierry Jéron and Claude Jard. Testing for unboundedness of fifo channels. Theoretical Computer Science, 113(1): 93-117, 1993.
14. J. K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Proc. of Protocol Specification, Testing and Verification, VII, 1987.
15. Wuxu Peng and S. Purushothaman. Data flow analysis of communicating finite state machines. ACM Transactions on Programming Languages and Systems, 13(3): 399-442, July 1991.