A. Ku#era. On eoeective decomposability of sequential behaviours. Theoretical Computer Science. To appear. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Deciding Bisimulation-Like Equivalences with Finite-State.. - Jancar, Kucera, Mayr (1999) (10 citations) (Correct)
....nets) the problem of weak bisimilarity with nitestate processes is undecidable. Decidability of bisimulation like equivalences has been intensively studied for various process classes (see [28] for a survey) The majority of the results are about the decidability of strong bisimilarity, e.g. [3,9,8,34,7,16,12]. Strong bisimilarity with nite state processes is known to be decidable for 2 (labeled) Petri nets [15] PA, and pushdown processes [14] Another positive result of this kind is presented in [22] where it is shown that weak bisimilarity is decidable between BPP and nite state processes. ....
A. Ku#era. On eoeective decomposability of sequential behaviours. Theoretical Computer Science. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC