Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Algorithmics of Bisimilarity Anna Ingolfsdottir
 

Summary: The Algorithmics of Bisimilarity
Luca Aceto
Anna Ingolfsdottir
ICE-TCS1, School of Computer Science, ReykjavŽik University
Kringlan 1, 103 ReykjavŽik, Iceland
JirŽi Srba
Department of Computer Science, Aalborg University
9220 Aalborg Ű, Denmark
Contents
0.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . page 4
0.2 Classic algorithms for bisimilarity over finite labelled transition
systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
0.3 The complexity of checking bisimilarity over finite processes . . . . . . . . . 25
0.4 Decidability results for bisimilarity over infinite-state systems . . . . . . . 46
0.5 The use of bisimilarity checking in verification and tools. . . . . . . . . . . . . 61
Bibliography 69
3
4 Introduction
0.1 Introduction
A model for reactive computation, for example that of labelled transition sys-

  

Source: Aceto, Luca - School of Computer Science, Reykjavík University

 

Collections: Mathematics; Computer Technologies and Information Sciences