Karp-Miller trees for a branching extension of VASS

Discrete Mathematics and Theoretical Computer Science

Volumn 7, Issue 1, 2005, Pages

  Verma, Kumar Neeraj ^a   Goubault Larrecq, Jean ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Branching vector addition systems; Coverability; Equational tree automata; Karp Miller trees; Multiplicative exponential linear logic

Indexed keywords

ASSOCIATIVE PROCESSING; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FINITE DIFFERENCE METHOD; VECTORS;

COVERABILITY; EQUATIONAL TREE AUTOMATA; KARP-MILLER TREES; MULTIPLICATIVE EXPONENTIAL LINEAR LOGIC;

TREES (MATHEMATICS);

EID: 27744557281     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. [AÉI02] Luca Aceto, Zoltán Ésik, and Anna Ingólfsdóttir. A fully equational proof of Parikh's theorem. RAIRO, Theoretical Informatics and Applications, 36:129-153, 2002.
2. [CDG+97] Hubert Comon, Max Dauchet, Rémi Gilleron, Florent Jacquemard, Denis Lugiez, Sophie Tison, and Marc Tommasi. Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata, 1997.
3. [dGGS04] Philippe de Groote, Bruno Guillaume, and Sylvain Salvati. Vector addition tree automata. In 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pages 64-73, Turku, Finland, July 2004. IEEE Computer Society Press.
4. [GLRV05] Jean Goubault-Larrecq, Muriel Roger, and Kumar Neeraj Verma. Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. Journal of Logic and Algebraic Programming, 64(2):219-251, August 2005.
5. [GLV02] Jean Goubault-Larrecq and Kumar Neeraj Verma. Alternating two-way AC-tree automata. Research Report LSV-02-11, LSV, ENS Cachan, Cachan, France, September 2002.
6. [GS66] Seymour Ginsburg and Edwin H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematic, 16(2):285-296, 1966.
7. [HP79] J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
8. [Kan94] Max I. Kanovich. Linear logic as a logic of computations. Annals of Pure and Applied Logic, 67:183-212, 1994.
9. [Kan95] Max I. Kanovich. Petri nets, Horn programs, linear logic and vector games. Annals of Pure and Applied Logic, 75:107-135, 1995.
10. [Kan96] Max I. Kanovich. Linear logic automata. Annals of Pure and Applied Logic, 78:147-188, 1996.
11. [KM69] R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2): 147-195, 1969.
12. [Kos82] S. R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th Symp. Theory of Computing, pages 267-281. ACM, 1982.
13. [Lam92] Jean-Luc Lambert. A structure to decide reachability in Petri nets. Theoretical Computer Science, 99:79-104, 1992.
14. [Lug03] Denis Lugiez. Counting and equality constraints for multitree automata. In Andrew D. Gordon, editor, 6th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS'03), volume 2620 of LNCS, pages 328-342, Warsaw, Poland, 2003. Springer-Verlag.
15. [May84] E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, 13:441-460, 1984.
16. [MR98] Richard Mayr and Michaël Rusinowitch. Reachability is decidable for ground AC rewrite systems. In Proceedings of the 3rd INFINITY Workshop, Aalborg, Denmark, 1998.
17. [Mü184] H. Müller. The reachability problem for VAS. In Advances in Petri nets. Springer-Verlag LNCS 188, 1984.
18. [Ohs01] Hitoshi Ohsaki. Beyond regularity: Equational tree automata for associative and commutative theories. In Laurent Fribourg, editor, 10th Annual Conference of the European Association for Computer Science Logic (CSL'01), volume 2142 of LNCS, pages 539-553, Paris, France, September 2001. Springer-Verlag.
19. [Par66] Rohit J. Parikh. On context-free languages. Journal of the ACM, 13(4):570-581, October 1966.
20. [Reu89] Christophe Reutenauer. Aspects Mathématiques des Réseaux de Pétri. Masson, 1989.
21. [Ver03a] Kumar Neeraj Verma. Automates d'arbres bidirectionnels modulo théories équationnelles. PhD thesis, ENS Cachan, 2003.
22. [Ver03b] Kumar Neeraj Verma. On closure under complementation of equational tree automata for theories extending AC. In Moshe Vardi and Andrei Voronkov, editors, 10th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'03), volume 2850 of LNAI, pages 183-197, Almaty, Kazakhstan, September 2003. Springer-Verlag.
23. [Ver03c] Kumar Neeraj Verma. Two-way equational tree automata for AC-like theories: Decidability and closure properties. In Robert Nieuwenhuis, editor, 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of LNCS, pages 180-196, Valencia, Spain, June 2003. Springer-Verlag.
24. [VGL04] Kumar Neeraj Verma and Jean Goubault-Larrecq. Karp-Miller trees for a branching extension of VASS. Research Report LSV-04-3, LSV, ENS Cachan, France, January 2004. Available at http://www.lsv.ens-cachan.fr/Publis/ RAPPORTS_LSV/PS/rr-lsv-2004-3.rr.ps.