Deciding bisimilarity is<Emphasis Type="Italic">P</Emphasis>-complete |
| |
Authors: | José Balcázar Joaquim Gabarró Miklós Sántha |
| |
Affiliation: | 1.Dep. de Llenguatges i Sistemes Informátics,Universitat Politécnica de Catalunya,Barcelona,Spain;2.CNRS, URA 410,Université Paris-Sud, LRI,Orsay,France |
| |
Abstract: | In finite labelled transition systems the problems of deciding strong bisimilarity, observation equivalence and observation congruence areP-complete under many—oneNC-reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of anNC algorithm to solve any of these problems will require an algorithmic breakthrough, which is exceedingly hard to achieve. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|