On Finite Representations of Infinite-State Behaviours

Abstract. We examine the problem of finite-state representability of infinitestate 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.

• Type: Conference
• Year: 1997
• Where: SOFSEM
• Authors: Antonín Kucera
• Keywords: Certain Behavioural Equivalences, Finite Characterization, SOFSEM 1997, Strong Regularity, Theoretical Computer Science