More Infinite Results
Olaf Burkart, Javier Esparza · Electronic Notes in Theoretical Computer Science · 1997
Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinite-state systems. The following two problems have been intensely investigated: (1) given two infinite-state systems, are they equal with respect to a certain equivalence notion?, and (2) given an infinite-state system and a property expressed in a certain temporal logic, does the system satisfy the property? In his paper “Infinite Results” [Mol96], Moller surveys some of the key results on the decidability and complexity of problem (1). This paper is a survey on the results about problem (2).