P. Jancar and J. Esparza. Deciding niteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, vol. 1099 of LNCS, pp. 478-489. Springer, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....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. However, weak bisimilarity with nite state processes is undecidable for Petri nets [13]. In this paper we obtain original positive results for PAD (and hence also PA and PDA) processes, and an undecidability result for state extended BPP processes. Moreover, all positive results are proved using the same general strategy which can also be adapted to the previously established ones. ....

....StExt(BPA) i.e. PDA) processes and nite state ones. In the case of StExt(BPP) strong bisimilarity with nite state processes is decidable [15] Here we demonstrate that the problem for weak bisimilarity is undecidable. Our proof is obtained by modifying the construction which has been used in [13] to show the undecidability of weak bisimilarity between Petri nets and nite state systems. To make this paper self contained, we now give a concise description of this modied construction. Theorem 26 Weak bisimilarity is undecidable between StExt(BPP) processes and nite state ones. PROOF. ....

[Article contains additional citation context not shown here]

P. Jan#ar and J. Esparza. Deciding niteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, volume 1099 of Lecture Notes in Computer Science, pages 478489. Springer, 1996. 28

No context found.

P. Jancar and J. Esparza. Deciding niteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, vol. 1099 of LNCS, pp. 478-489. Springer, 1996.

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