Skip to main content
SpringerLink
Log in

Reactive Synthesis from Visibly Register Pushdown Automata

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2021 (ICTAC 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12819))

Included in the following conference series:

Abstract

The realizability problem for a given specification \(\mathcal{S}\) is to decide whether there exists an implementation satisfying \(\mathcal{S}\). Although the problem is important in the field of reactive synthesis of recursive programs, the problem has not been studied yet when specification and implementation are given by pushdown computational models. This paper investigates the realizability problem for the cases that a specification and an implementation are given by a pushdown automaton (PDA) and a pushdown transducer (PDT), and a register pushdown automata (RPDA) and a register pushdown transducer (RPDT).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th ACM Symposium Theory of Computing (STOC 2004) (2004)

    Google Scholar 

  2. Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 921–962. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-10575-8_27

    Chapter  Google Scholar 

  3. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Logic 12(4) (2011)

    Google Scholar 

  4. Bojańczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods Comput. Sci. 10(3:4), 1–44 (2014)

    Google Scholar 

  5. Bollig, B., Cyriac, A., Gastin, P., Narayan Kumar, K.: Model checking languages of data words. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 391–405. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28729-9_26

    Chapter  MATH  Google Scholar 

  6. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63141-0_10

    Chapter  Google Scholar 

  7. Bouyer, P.: A logical characterization of data languages. Inform. Process. Lett. 84(2), 75–85 (2002)

    Article  MathSciNet  Google Scholar 

  8. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Am. Math. Soc. 138, 295–311 (1969)

    Article  MathSciNet  Google Scholar 

  9. Chen, Y.-F., Lengál, O., Tan, T., Wu, Z.: Register automata with linear arithmetic. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) (2017)

    Google Scholar 

  10. Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245–267 (1998)

    Article  MathSciNet  Google Scholar 

  11. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2001)

    Book  Google Scholar 

  12. Clemente, L., Lasota, S.: Reachability analysis of first-order definable pushdown systems. In: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), pp. 244–259 (2015)

    Google Scholar 

  13. D’Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 3–21. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25540-4_1

    Chapter  Google Scholar 

  14. Demri, S., Lazić, R.: LTL with freeze quantifier and register automata. ACM Trans. Comput. Logic 10(3) (2009)

    Google Scholar 

  15. Demri, S., Lazić, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. Inform. Comput. 205(1), 2–24 (2007)

    Article  MathSciNet  Google Scholar 

  16. Ehlers, R., Seshia, S.A., Kress-Gazit, H.: Synthesis with identifiers. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 415–433. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54013-4_23

    Chapter  Google Scholar 

  17. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232–247. Springer, Heidelberg (2000). https://doi.org/10.1007/10722167_20

    Chapter  Google Scholar 

  18. Esparza, J., Kučera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inform. Comput. 186(2), 355–376 (2003)

    Article  MathSciNet  Google Scholar 

  19. Exibard, L., Filiot, E., Reynier, P.-A.: Synthesis of data word transducers. In: 30th International Conference on Concurrency Theory (CONCUR 2019) (2019)

    Google Scholar 

  20. Greibach, S.A.: A note on pushdown store automata and regular systems. Proc. Am. Math. Soc. 18, 263–268 (1967)

    Article  MathSciNet  Google Scholar 

  21. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134, 322–363 (1994)

    Article  MathSciNet  Google Scholar 

  22. Khalimov, A., Kupferman, O.: Register-bounded synthesis. In: 30th International Conference on Concurrency Theory (CONCUR 2019) (2019)

    Google Scholar 

  23. Khalimov, A., Maderbacher, B., Bloem, R.: Bounded synthesis of register transducers. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 494–510. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01090-4_29

    Chapter  Google Scholar 

  24. Libkin, L., Tan, T., Vrgoč, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278–1297 (2015)

    Article  MathSciNet  Google Scholar 

  25. Libkin, L., Vrgoč, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74–85 (2012)

    Google Scholar 

  26. Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. J. Comput. Syst. Sci. 87, 58–83 (2017)

    Article  MathSciNet  Google Scholar 

  27. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403–435 (2004)

    Article  MathSciNet  Google Scholar 

  28. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: 16th ACM Symposium on Principles of Programming Languages (POPL 1989), pp. 179–190 (1989)

    Google Scholar 

  29. Rot, J., de Boer, F., Bonsangue, M.: Pushdown system representation for unbounded object creation, Technical report KIT-13, Karlsruhe Institute of Technology, pp. 38–52 (2010)

    Google Scholar 

  30. Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41–57. Springer, Heidelberg (2006). https://doi.org/10.1007/11874683_3

    Chapter  Google Scholar 

  31. Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415–434. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-02508-3_22

    Chapter  Google Scholar 

  32. Senda, R., Takata, Y., Seki, H.: Generalized register context-free grammars. In: 13th International Conference on Language and Automata Theory and Applications (LATA 2019), pp. 259–271 (2019). Revised version: IEICE Trans. Inf. Syst. E103-D(3), 540–548 (2020)

    Google Scholar 

  33. Senda, R., Takata, Y., Seki, H.: Forward regularity preservation property of register pushdown systems. IEICE Trans. Inf. Syst. E104-D(3), 370–380 (2021)

    Google Scholar 

  34. Song, F., Touili, T.: Pushdown model checking for malware detection. TACAS 2012. Extended version. Int. J. Softw. Tools. Tehchnol. Transfer 16, 147–173 (2014)

    Google Scholar 

  35. Tzevelekos, N.: Fresh-register automata. In: 36th ACM Annual Symposium on Principles of Programming Languages (POPL 2009), pp. 295–306 (2009)

    Google Scholar 

  36. Walukiewicz, I.: Pushdown processes: games and model-checking. In: 8th International Conference on Computer Aided Verification (CAV 1996), pp. 62–74 (1996). Revised version: Inform. Comput. 164, 234–263 (2001)

    Google Scholar 

  37. Cai, X., Ogawa, M.: Well-structured pushdown systems. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 121–136. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40184-8_10

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Informatics, Nagoya University, Furo-cho, Chikusa, Nagoya, 464-8601, Japan

    Ryoma Senda & Hiroyuki Seki

  2. Graduate School of Engineering, Kochi University of Technology, Tosayamada, Kami City, Kochi, 782-8502, Japan

    Yoshiaki Takata

Authors
  1. Ryoma Senda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiaki Takata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroyuki Seki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ryoma Senda .

Editor information

Editors and Affiliations

  1. Nazarbayev University, Nur-Sultan, Kazakhstan

    Antonio Cerone

  2. Department of Informatics, University of Oslo, Oslo, Norway

    Peter Csaba Ölveczky

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Senda, R., Takata, Y., Seki, H. (2021). Reactive Synthesis from Visibly Register Pushdown Automata. In: Cerone, A., Ölveczky, P.C. (eds) Theoretical Aspects of Computing – ICTAC 2021. ICTAC 2021. Lecture Notes in Computer Science(), vol 12819. Springer, Cham. https://doi.org/10.1007/978-3-030-85315-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85315-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85314-3

  • Online ISBN: 978-3-030-85315-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation