Verification of dynamic register automata

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 29, Issue , 2014, Pages 653-665

  Abdulla, Parosh Aziz ^a   Atig, Mohamed Faouzi ^a   Kara, Ahmet ^b   Rezine, Othmane ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Reachability problem; Register automata; Verification

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; DIRECTED GRAPHS; SOFTWARE ENGINEERING; VERIFICATION;

COMMUNICATION GRAPHS; NON-PRIMITIVE RECURSIVE COMPLEXITY; PROCESS CREATION; REACHABILITY PROBLEM; REGISTER AUTOMATA; STATE REACHABILITY; UNDIRECTED GRAPH; VERIFICATION PROBLEMS;

ROBOTS;

EID: 84921513842     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2014.653     Document Type: Conference Paper

References (28)

1. Parosh Aziz Abdula, Mohamed Faouzi Atig, and Othmane Rezine. Verification of directed acyclic ad hoc networks. In FMOODS/FORTE, pages 193-208, 2013.
2. P. A. Abdulla, K. Cerans, B. Jonsson, and Y. K. Tsay. General decidability theorems for infinite-state systems. In LICS'96, pages 313-321. IEEE Computer Society, 1996.
3. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Inf. Comput., 127(2):91-101, 1996.
4. Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, and Vasumathi Narayanan. Causal closure for MSC languages. In FSTTCS, volume 3821 of LNCS, pages 335-347. Springer, 2005.
5. Rajeev Alur, Kousha Etessami, and Mihalis Yannakakis. Realizability and verification of MSC graphs. Theor. Comput. Sci., 331(1):97-114, 2005.
6. Michael Benedikt, Clemens Ley, and Gabriele Puppis. Automata vs. logics on data words. In CSL, volume 6247 of LNCS, pages 110-124. Springer, 2010.
7. Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, and Thomas Schwentick. Dynamic communicating automata and branching high-level MSCs. In LATA, volume 7810 of LNCS. Springer, 2013.
8. Benedikt Bollig and Loïc Hélouët. Realizability of dynamic MSC languages. In CSR, volume 6072 of LNCS. Springer, 2010.
9. Daniel Brand and Pitro Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, 1983.
10. G. Delzanno, A. Sangnier, and G. Zavattaro. Parameterized verification of ad hoc networks. In CONCUR'10, volume 6269 of LNCS. Springer, 2010.
11. G. Delzanno, A. Sangnier, and G. Zavattaro. On the power of cliques in the parameterized verification of ad hoc networks. In FoSSaCS'11, volume 6604 of LNCS, pages 441-455. Springer, 2011.
12. Giorgio Delzanno, Arnaud Sangnier, and Riccardo Traverso. Parameterized verification of broadcast networks of register automata. In RP, volume 8169 of LNCS. Springer, 2013.
13. Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, and Gianluigi Zavattaro. On the complexity of parameterized reachability in reconfigurable broadcast networks. In FSTTCS, volume 18 of LIPIcs. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2012.
14. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. In LICS, pages 17-26. IEEE Computer Society, 2006.
15. D. Figueira. Alternating register automata on finite words and trees. Logical Methods in Computer Science, 8(1), 2012.
16. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
17. Blaise Genest, Dietrich Kuske, and Anca Muscholl. A kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput., 204(6):920-956, 2006.
18. Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni, and P. S. Thiagarajan. A theory of regular MSC languages. Inf. Comput., 202(1):1-38, 2005.
19. M. Jurdzinski and R. Lazic. Alternation-free modal mu-calculus for data trees. In LICS, pages 131-140. IEEE Computer Society, 2007.
20. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329-363, 1994.
21. Ranko Lazic. Safely freezing LTL. In FSTTCS, volume 4337 of LNCS, pages 381-392. Springer, 2006.
22. Anca Muscholl and Doron Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS, volume 1672 of LNCS, pages 81-91. Springer, 1999.
23. Frank Neven, Thomas Schwentick, and Victor Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log., 5(3):403-435, 2004.
24. Hiroshi Sakamoto and Daisuke Ikeda. Intractability of decision problems for finite-memory automata. Theor. Comput. Sci., 231(2):297-308, 2000.
25. P. Schnoebelen. Revisiting ackermann-hardness for lossy counter machines and reset petri nets. In MFCS, volume 6281 of LNCS, pages 616-628. Springer, 2010.
26. Anu Singh, C. R. Ramakrishnan, and Scott A. Smolka. Query-based model checking of ad hoc network protocols. In CONCUR, volume 5710 of LNCS, pages 603-619. Springer, 2009.
27. Anu Singh, C. R. Ramakrishnan, and Scott A. Smolka. A process calculus for mobile ad hoc networks. Sci. Comput. Program., 75(6):440-469, 2010.
28. Nikos Tzevelekos. Fresh-register automata. In POPL. ACM, 2011.