On finite representations of infinite-state behaviours

  • Antonín Kučera
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1338)


We examine the problem of finite-state representability of infinite-state processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek's hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the condition of strong regularity guarantees an existence of finite characterization in case of all equivalences of van Glabbeek's hierarchy, and we also demonstrate that there are behaviours which are regular but not strongly regular w.r.t. all equivalences of the mentioned hierarchy except bisimilarity.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BCS96]
    O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR'96, volume 1119 of LNCS, pages 247–262. Springer-Verlag, 1996.Google Scholar
  2. [BG96]
    D.J.B. Bosscher and W.O.D. Griffionen. Regularity for a large class of context-free processes is decidable. In Proceedings of ICALP'96 [Ica96], pages 182–192.Google Scholar
  3. [ČKK97]
    I. Čer ná, M. Křetínský, and A. Kučera. Bisimilarity is decidable in the union of normed BPA and normed BPP processes. Electronic Notes in Theoretical Computer Science, 6, 1997.Google Scholar
  4. [Ica96]
    Proceedings of ICALP'96, volume 1099 of LNCS. Springer-Verlag, 1996.Google Scholar
  5. [Jan97]
    P. Jancar. Bisimulation equivalence is decidable for one-counter processes. In Proceedings of ICALP'97, volume 1256 of LNCS pages 549–559. Springer-Verlag, 1997.Google Scholar
  6. [JE96]
    P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity In Proceedings of ICALP'96 [Ica96], pages 478–489.Google Scholar
  7. [Kuč96]
    A. Kucera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS'96, volume 1180 of LNCS, pages 111–122. Springer-Verlag, 1996.Google Scholar
  8. [Kuč97]
    A. Kučera. How to parallelize sequential processes. In Proceedings of CONCUR'97, volume 1243 of LNCS, pages 302–316. Springer-Verlag, 1997.Google Scholar
  9. [Mil89]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  10. [MM94]
    S. Mauw and H. Mulder. Regularity of BPA-systems is decidable. In Proceedings of CONCUR'94, volume 836 of LNCS pages 34–47. Springer-Verlag, 1994.Google Scholar
  11. [vG90]
    R.J. van Glabbeek. The linear time—branching time spectrum. In Proceedings of CONCUR'90, volume 458 of LNCS pages 278–297. Springer-Verlag, 1990.Google Scholar
  12. [vGW89]
    R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. Information Processing 89, pages 613–618, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antonín Kučera
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations