M. Jurdzi nski and M. Nielsen. Hereditary history preserving bisimilarity is undecidable. In Proc. STACS'00, LNCS 1770, 358-369. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Polynomial-Time Algorithm for Deciding True - Concurrency Equivalences Of (Correct)
.... BPP can be contrasted with the EXPTIME completeness on finite state systems (finite 1 safe nets) 21] Similarly, decidability of hereditary history preserving bisimilarity [4] on BPP, proved in [12] can be contrasted with undecidability on finite 1 safe nets shown by Jurdzi nski and Nielsen in [22]. We start by Section 2 containing definitions and some basic facts and then we outline our algorithm in Section 3. The algorithm works for BPP processes in standard form, similarly as in [9] A polynomial time preprocessing procedure transforming a process into standard form is described in ....
M. Jurdzi nski and M. Nielsen. Hereditary history preserving bisimilarity is undecidable. In Proc. STACS'00, LNCS 1770, 358-369.
A Polynomial-Time Algorithm for Deciding True Concurrency.. - Lasota (2002) (Correct)
.... BPP can be contrasted with the EXPTIME completeness on finite state systems (finite 1 safe nets) 21] Similarly, decidability of hereditary history preserving bisimilarity [4] on BPP, proved in [12] can be contrasted with undecidability on finite 1 safe nets shown by Jurdzi nski and Nielsen in [22]. We start by Section 2 containing basic definitions and then we outline our algorithm in Section 3. The algorithm works for BPP processes in standard form, similarly as in [9] A polynomial time preprocessing procedure transforming a process into standard form is described in Appendix A. 2 ....
M. Jurdzi nski and M. Nielsen. Hereditary history preserving bisimilarity is undecidable. In Proc. STACS'00, LNCS 1770, 358-369.
A polynomial-time algorithm for deciding true concurrency.. - Lasota (2002) (Correct)
.... on BPP can be contrasted with the EXPTIME completeness on finite state systems (finite 1 safe nets) 21] Similarly, decidability of hereditary history preserving bisimilarity [4, 22] on BPP, proved in [13] can be contrasted with undecidability on finite 1 safe nets shown by Jurdzi nski in [23]. We start by Section 2 containing basic definitions and then we outline our algorithm in Section 3. The algorithm works for BPP processes in standard form, similarly as in [9] A polynomial time preprocessing procedure transforming a process into standard form is described in Appendix. 2 ....
M. Jurdzi nski and M. Nielsen. Hereditary history preserving bisimilarity is undecidable. In Proc. 17th International Symposium on Theoretical Aspects of Computer Science (STACS'00), LNCS 1770, 358-369.
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