Reachability analysis of first-order definable pushdown systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 41, Issue , 2015, Pages 244-259

  Clemente, Lorenzo ^a   Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Automata theory; Pushdown systems; Saturation technique digital object identifier; Sets with atoms

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; CONCRETES; RECONFIGURABLE HARDWARE;

CONTROL STATE; DIGITAL OBJECTS; HOMOGENEOUS STRUCTURE; OPTIMAL COMPLEXITY; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS; TRANSITION RELATIONS; WREATH PRODUCTS;

CELLULAR AUTOMATA;

EID: 84959272234     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.CSL.2015.244     Document Type: Conference Paper

References (27)

1. P. A. Abdulla, M. F. Atig, and J. Stenman. Dense-timed pushdown automata. In Proc. of LICS'12, pages 35-44, june 2012.
2. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg. Timed lossy channel systems. In Proc. of FSTTCS'12, volume 18 of LIPIcs, pages 374-386, 2012.
3. Parosh Aziz Abdulla and Aletta Nylén. Timed Petri nets and BQOs. In Proc. of ICATPN' 01, pages 53-70, 2001.
4. Mohamed F. Atig. Model-checking of ordered multi-pushdown automata. Log. Methods Comput. Sci., 8(3), 09 2012.
5. Mikołaj Bojanczyk, Bartek Klin, and Sławomir Lasota. Automata theory in nominal sets. Logical Methods in Computer Science, 10(3:4): paper 4, 2014.
6. Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, and K. Narayan Kumar. Model checking languages of data words. In Lars Birkedal, editor, Proc. of FOSSACS'12, volume 7213 of LNCS, pages 391-405. Springer, 2012.
7. Ahmed Bouajjani, Javier Esparza, and Oded Maler. Reachability analysis of pushdown automata: Application to model-checking and saturation method. In Proc. of CONCUR'97, volume 1243 of LNCS, pages 135-150, 1997.
8. Ahmed Bouajjani, Peter Habermehl, Yan Jurski, and Mihaela Sighireanu. Rewriting systems with data. In In Proc. of FCT'07, volume 4639 of LNCS, pages 1-22. Springer, 2007.
9. Luca Breveglieri, Alessandra Cherubini, Claudio Citrini, and Stefano Crespi-Reghizzi. Multi-push-down languages and grammars. Int. J. Found. Comput. Sci., 7(3):253-292, 1996.
10. Chris Broadbent, Arnaud Carayol, Matthew Hague, and Olivier Serre. A saturation method for collapsible pushdown systems. In Proc. of ICALP'12, volume 7392 of LNCS, pages 165-176, 2012.
11. Arnaud Carayol and Matthew Hague. Saturation algorithms for model-checking pushdown systems. In Proc. of AFL'14, volume 151 of EPTCS, pages 1-24, 5 2014.
12. Edward Y. C. Cheng and Michael Kaminski. Context-free languages over infinite alphabets. Acta Inf., 35(3):245-267, 1998.
13. L. Clemente and S. Lasota. Timed pushdown automata revisited. In Proc. of LICS'15, 2015. Accepted for publication.
14. Wojciech Czerwiński, Piotr Hofman, and Sławomir Lasota. Reachability problem for weak multi-pushdown automata. Logical Methods in Computer Science, 9(3:13):1-29, 2013.
15. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic, 10(3):16:1-16:30, April 2009.
16. Alin Deutsch, Richard Hull, Fabio Patrizi, and Victor Vianu. Automatic verification of data-centric business processes. In Proc. of ICDT'09, pages 252-267, New York, NY, USA, 2009. ACM.
17. Javier Esparza and Stefan Schwoon. A BDD-based model checker for recursive programs. In Proc. of CAV'01, CAV'01, pages 324-336. Springer-Verlag, 2001.
18. Alain Finkel, Bernard Willems, and Pierre Wolper. A direct symbolic approach to model checking pushdown systems. In Proc. of INFINITY'97, volume 9, pages 27-37, 1997.
19. R. Fraïssé. Theory of relations. North-Holland, 1953.
20. Irène Guessarian. Pushdown tree automata. Theor. Comp. Sys., 16:237-263, 1983.
21. Ward Henson. Countable homogeneous relational structures and @0-categorical theories. J. Symb. Logic, 37:494-500, 1972.
22. Slawomir Lasota and Igor Walukiewicz. Alternating timed automata. ACM Trans. Comput. Logic, 9(2):10:1-10:27, 2008.
23. Ranko Lazic, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, and James Worrell. Nets with tokens which carry data. In Proc. of ICATPN'07, LNCS, pages 301-320. Springer-Verlag, 2007.
24. Dugald Macpherson. A survey of homogeneous structures. Discrete Mathematics, 311(15):1599-1634, 2011.
25. A. N. Maslov. Multilevel stack automata. Probl. Peredachi Inf., 12(1):55-62, 1976.
26. Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos. Reachability in pushdown register automata. In MFCS 2014, pages 464-473, 2014.
27. Joel Ouaknine and James Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In In Proc. of LICS'04, pages 54-63. IEEE Computer Society, 2004.