Decidability of weak simulation on one-counter nets

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2013, Pages 203-212

  Hofman, Piotr ^a   Mayr, Richard ^b   Totzke, Patrick ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Automata theory; One counter machines

Indexed keywords

APPROXIMANTS; SEMANTIC RELATIONS; SIMULATION PREORDER; TRACE INCLUSION; WEAK BISIMULATION; WEAK TEST;

AUTOMATA THEORY; COMPUTER SCIENCE; PETRI NETS; SEMANTICS;

COMPUTABILITY AND DECIDABILITY;

EID: 84883395949     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2013.26     Document Type: Conference Paper

References (23)

1. R. Mayr, "Undecidability of weak bisimulation equivalence for 1-counter processes, " in ICALP, ser. LNCS, vol. 2719, 2003, pp. 570-583.
2. O. Serre, "Parity games played on transition graphs of one-counter processes, " in FoSSaCS, ser. LNCS, vol. 3921, 2006, pp. 337-351.
3. S. Göller, R. Mayr, and A. W. To, "On the computational complexity of verifying one-counter processes, " in LICS. IEEE, 2009, pp. 235-244.
4. S. Göller and M. Lohrey, "Branching-time model checking of onecounter processes, " in STACS, ser. LIPIcs, vol. 5. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2010, pp. 405-416.
5. R. v. Glabbeek, "The linear time-branching time spectrum I; the semantics of concrete, sequential processes, " in Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, Eds. Elsevier, 2001, ch. 1, pp. 3-99.
6. S. Böhm, S. Göller, and P. Jan?car, "Bisimilarity of one-counter processes is PSPACE-complete, " in CONCUR, ser. LNCS, vol. 6269, 2010.
7. P. A. Abdulla and K. Cerans, "Simulation is decidable for one-counter nets (extended abstract), " in CONCUR, ser. LNCS, vol. 1466, 1998.
8. P. Jan?car and F. Moller, "Simulation of one-counter nets via colouring, " Report, Uppsala Computing Science, Tech. Rep., February 1999.
9. P. Jan?car, A. Kucera, and F. Moller, "Simulation and bisimulation over one-counter processes, " in STACS, ser. LNCS, vol. 1770, 2000.
10. P. Jan?car, F. Moller, and Z. Sawa, "Simulation problems for one-counter machines, " in SOFSEM, ser. LNCS, vol. 1725, 1999, pp. 404-413.
11. P. Jan?car, "Undecidability of bisimilarity for Petri nets and some related problems, " Theor. Comput. Sci., vol. 148, no. 2, pp. 281-301, 1995.
12. L. Valiant, "Decision procedures for families of deterministic pushdown automata, " Ph. D. dissertation, Department of Computer Science, University of Warwick, Coventry, July 1973.
13. J. Esparza and M. Nielsen, "Decibility issues for Petri nets-A survey, " Journal of Informatik Processing and Cybernetics, vol. 30, no. 3, pp. 143-160, 1994.
14. A. Kucera and R. Mayr, "Why is simulation harder than bisimulation?" in CONCUR, ser. LNCS, vol. 2421. Springer, 2002, pp. 594-609.
15. P. Hofman, R. Mayr, and P. Totzke, "Decidability of weak simulation on one-counter nets, " University of Edinburgh, Tech. Rep. EDI-INF-RR-1415, 2013, arXiv:1304. 4104 and http://www. inf. ed. ac. uk/publications/report/ 1415. html.
16. S. Almagor, U. Boker, and O. Kupferman, "What's decidable about weighted automata?" in ATVA, ser. LNCS, vol. 6996, 2011.
17. A. Kucera, "On simulation-checking with sequential systems, " in ASIAN, ser. LNCS, vol. 1961, 2000, pp. 133-148.
18. P. Jan?car, J. Esparza, and F. Moller, "Petri nets and regular processes, " J. Comput. Syst. Sci., vol. 59, no. 3, pp. 476-503, 1999.
19. K. Etessami, D. Wojtczak, and M. Yannakakis, "Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems, " in QEST. IEEE, 2008, pp. 243-253.
20. A. Meyer and L. Stockmeyer, "The equivalence problem for regular expressions with squaring requires exponential space, " in Symp. Foundations of Computer Science. IEEE, 1972, pp. 125-129.
21. Z. Sawa and P. Jan?car, "P-hardness of equivalence testing on finite-state processes, " in SOFSEM, ser. LNCS, vol. 2234, 2001.
22. J. Srba, "Beyond language equivalence on visibly pushdown automata, " Logical Methods in Computer Science, vol. 5, no. 1, pp. 1-22, 2009.
23. A. Kucera, "Efficient verification algorithms for one-counter processes, " in ICALP, ser. LNCS, vol. 1853, 2000, pp. 317-328.