Skip to main content
SpringerLink
Log in

On-The-Fly Bisimilarity Checking for Fresh-Register Automata

  • Conference paper
  • First Online:
Dependable Software Engineering. Theories, Tools, and Applications (SETTA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13649))

  • 280 Accesses

Abstract

Register automata are one of the simplest classes of automata that operate on infinite alphabets. Each automaton comes equipped with a finite set of registers where it can store data values and compare them with others from the input. Fresh-register automata are additionally able to accept a given data value just if it is fresh in the computation history. The bisimilarity problem for fresh-register automata is known to be in NP, when empty registers and duplicate register content are forbidden. In this paper, we investigate on-the-fly algorithms for solving bisimilarity, which attempt to build a bisimulation relation starting from a given input configuration pair. We propose an algorithm that uses concise representations of candidate bisimulation relations based on generating systems. While the algorithm runs in exponential time in the worst case, we demonstrate through a series of benchmarks its efficiency compared to existing algorithms and tools. We moreover implement a translation from \(\pi \)-calculus processes to fresh-register automata, and use the latter to obtain a prototype (strong early) bisimilarity checking tool for finitary \(\pi \)-calculus processes.

M. H. Bandukara—Supported by EPSRC DTP EP/R513106/1.

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Notes

  1. 1.

    We view automata as accepting words from a given input alphabet.

  2. 2.

    https://github.com/HamzaBandukara/FRABisim.

  3. 3.

    In fact, this holds for processes that are finitary up to structural congruence [16, 29].

  4. 4.

    http://piet.sourceforge.net/ implemented by Matteo Mio.

References

  1. Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.: Learning register automata with fresh value generation. In: ICTAC Proceedings, pp. 165–183 (2015)

    Google Scholar 

  2. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the SPI calculus. Inf. Comput. 148(1), 1–70 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aceto, L., Ingólfsdóttir, A., Srba, J.: The algorithmics of bisimilarity. In: Advanced Topics in Bisimulation and Coinduction, pp. 100–172. CUP (2012)

    Google Scholar 

  4. Babai, L.: On the length of subgroup chains in the symmetric group. Comm. Algebra 14(9), 1729–1736 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. LMCS 10(3), 1–14 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A robust class of data languages and an application to learning. LMCS 10(4), 1–9 (2014)

    MathSciNet  MATH  Google Scholar 

  7. Fernandez, J.-C., Mounier, L.: “On the fly’’ verification of behavioural equivalences and preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 181–191. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55179-4_18

    Chapter  Google Scholar 

  8. Ferrari, G.L., Montanari, U., Raggi, R., Tuosto, E.: From co-algebraic specifications to implementation: The Mihda toolkit. In: FMCO Revised Lectures (2002)

    Google Scholar 

  9. Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: TACAS Proceedings, pp. 260–276 (2013)

    Google Scholar 

  10. Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: LATA Proceedings, pp. 561–572 (2010)

    Google Scholar 

  11. Kaminski, M., Francez, N.: Finite-memory automata. Theoret. Comput. Sci. 134(2), 329–363 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Klin, B., Szynwelski, M.: SMT solving for functional programming over infinite structures. In: MSFP Proceedings, vol. 207, pp. 57–75 (2016)

    Google Scholar 

  13. Knuth, D.E.: Efficient representation of perm groups. Combinatorica 11, 33–43 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kopczynski, E., Torunczyk, S.: LOIS: syntax and semantics. In: POPL Proceedings, pp. 586–598. ACM (2017)

    Google Scholar 

  15. Lin, H.: Computing bisimulations for finite-control \(\pi \)-calculus. J. Comput. Sci. Technol. 15, 1–9 (2008)

    Article  MathSciNet  Google Scholar 

  16. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I and II. Inf. Comput. 100(1), 1–40 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: POPL Proceedings, pp. 613–625. ACM (2017)

    Google Scholar 

  18. Montanari, U., Pistore, M.: pi-calculus, structured coalgebras, and minimal HD-automata. In: Nielsen, M., Rovan, B. (eds.) MFCS Proceedings, pp. 569–578 (2000)

    Google Scholar 

  19. Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: DEQ: equivalence checker for deterministic register automata. In: ATVA Proceedings, pp. 350–356 (2019)

    Google Scholar 

  20. Murawski, A., Ramsay, S., Tzevelekos, N.: A contextual equivalence checker for IMJ*. In: ATVA Proceedings, pp. 234–240 (2015)

    Google Scholar 

  21. Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Bisimilarity in fresh-register automata. In: LICS Proceedings, pp. 156–167 (2015)

    Google Scholar 

  22. Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Polynomial-time equivalence testing for deterministic fresh-register automata. In: MFCS Proceedings (2018)

    Google Scholar 

  23. Murawski, A.S., Tzevelekos, N.: Algorithmic nominal game semantics. In: ESOP Proceedings, pp. 419–438 (2011)

    Google Scholar 

  24. Murawski, A.S., Tzevelekos, N.: Algorithmic games for full ground references. Formal Methods Syst. Des. 52(3), 277–314 (2018)

    Article  MATH  Google Scholar 

  25. 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  MATH  Google Scholar 

  26. Parrow, J., Borgström, J., Eriksson, L., Gutkovas, R., Weber, T.: Modal logics for nominal transition systems. Log. Methods Comput. Sci. 17(1), 1–14 (2021)

    MathSciNet  MATH  Google Scholar 

  27. Pistore, M.: History-Dependent Automata. Ph.D. thesis, Università di Pisa (1999)

    Google Scholar 

  28. Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297–308 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  29. Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  30. Schwentick, T.: Automata for XML-a survey. JCSS 73(3), 289–315 (2007)

    MathSciNet  MATH  Google Scholar 

  31. Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. https://oeis.org/A002720. Sep 2022

  32. Tzevelekos, N.: Fresh-register automata. In: POPL Proceedings. ACM (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queen Mary University of London, London, UK

    M. H. Bandukara & N. Tzevelekos

Authors
  1. M. H. Bandukara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Tzevelekos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Tzevelekos .

Editor information

Editors and Affiliations

  1. National University of Defense Technology, Changsha, China

    Wei Dong

  2. Inria, Rennes, France

    Jean-Pierre Talpin

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bandukara, M.H., Tzevelekos, N. (2022). On-The-Fly Bisimilarity Checking for Fresh-Register Automata. In: Dong, W., Talpin, JP. (eds) Dependable Software Engineering. Theories, Tools, and Applications. SETTA 2022. Lecture Notes in Computer Science, vol 13649. Springer, Cham. https://doi.org/10.1007/978-3-031-21213-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21213-0_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21212-3

  • Online ISBN: 978-3-031-21213-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation