Trace inclusion for one-counter nets revisited

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

Volumn 8762, Issue , 2014, Pages 151-162

  Hofman, Piotr ^a   Totzke, Patrick ^b  

^a UNIVERSITY OF BAYREUTH   (Germany)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COUNTER AUTOMATA; FINITE CONTROL; TRACE INCLUSION; UNIVERSALITY PROBLEM; ZERO TEST; DETERMINISTICS; INCLUSION PROBLEM;

PETRI NETS;

EID: 84921761881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-11439-2_12     Document Type: Article

References (17)

1. Abdulla, P.A., Cerans, K.: Simulation Is Decidable for One-Counter Nets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 253-268. Springer, Heidelberg (1998)
2. Böhm, S., Göller, S., Jančar, P.: Equivalence of Deterministic One-Counter Automata is NL-complete. In: STOC, pp. 131-140 (2013)
3. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic 10(3), 16:1-16:30 (2009)
4. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. In: LICS, pp. 269-278 (2011)
5. Higuchi, K., Wakatsuki, M., Tomita, E.: Some Properties of Deterministic Restricted One-Counter Automata. In: IEICE E79-D.8, pp. 914-924 (July 1996)
6. Hofman, P., Lasota, S., Mayr, R., Totzke, P.: Simulation Over Onecounter Nets is PSPACE-Complete. In: FSTTCS, pp. 515-526 (2013)
7. Hofman, P.,Mayr, R., Totzke, P.: Decidability ofWeak Simulation on One-Counter Nets. In: LICS, pp. 203-212 (2013)
8. Hofman, P., Totzke, P.: Trace Inclusion for One-Counter Nets Revisited. In: CoRR abs/1404.5157 (2014) (full version of this paper)
9. Jančar, P.: Equivalences of Pushdown Systems Are Hard. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 1-28. Springer, Heidelberg (2014)
10. Jančar, P.: Undecidability of Bisimilarity for Petri Nets and Some Related Problems. TCS 148(2), 281-301 (1995)
11. Jančar, P., Esparza, J., Moller, F.: Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3), 476-503 (1999)
12. Jančar, P., Kučera, A., Moller, F.: Simulation and Bisimulation over One-Counter Processes. In: STACS, pp. 334-345 (2000)
13. Sénizergues, G.: L(A) = L(B)? ENTCS 9, 43 (1997)
14. Stirling, C.: Deciding DPDA Equivalence Is Primitive Recursive. In: ICALP, pp. 821-832 (2002)
15. Totzke, P.: Inclusion Problems for One-Counter Systems. PhD thesis. LFCS, University of Edinburgh (2014)
16. Valiant, L.:Decision Procedures for Families ofDeterministic PushdownAutomata. PhD thesis. University of Warwick (1973)
17. Valiant, L., Paterson, M.S.: Deterministic One-Counter Automata. JCSS 10(3), 340-350 (1975)