Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 8
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Fu, Yuxi 2016. Theory of interaction. Theoretical Computer Science, Vol. 611, p. 1.


    Yang, Fei and Huang, Hao 2015. A polynomial time algorithm for checking regularity of totally normed process algebra. Journal of Shanghai Jiaotong University (Science), Vol. 20, Issue. 3, p. 273.


    Francesco, Nicoletta de Lettieri, Giuseppe Santone, Antonella and Vaglini, Gigliola 2014. GreASE. ACM Transactions on Software Engineering and Methodology, Vol. 23, Issue. 3, p. 1.


    Benedikt, Michael Goller, Stefan Kiefer, Stefan and Murawski, Andrzej S. 2013. 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 488.

    Kiefer, Stefan 2013. BPA bisimilarity is EXPTIME-hard. Information Processing Letters, Vol. 113, Issue. 4, p. 101.


    Bozzelli, Laura Legay, Axel and Pinchinat, Sophie 2011. Hardness of preorder checking for basic formalisms. Theoretical Computer Science, Vol. 412, Issue. 49, p. 6795.


    Kučera, Antonín and Mayr, Richard 2010. On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Information and Computation, Vol. 208, Issue. 7, p. 772.


    Crafa, Silvia Ranzato, Francesco and Tapparo, Francesco 2009. 2009 Ninth International Conference on Application of Concurrency to System Design. p. 60.

    ×
  • Theory and Practice of Logic Programming, Volume 6, Issue 3
  • May 2006, pp. 227-264

Equivalence-checking on infinite-state systems: Techniques and results

  • ANTONÍN KUČERA (a1) and PETR JANČAR (a2)
  • DOI: http://dx.doi.org/10.1017/S1471068406002651
  • Published online: 11 May 2006
Abstract

The paper presents a selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004).

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords: