H. Httel. Undecidable equivalences for basic parallel processes. In Proc. TACS'94, LNCS 789, pages 454--464, 1994. 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)
.... bisimilarity for BPP and even for BPP , extension of BPP by communication, was given in [10] The PSPACE lower bound has been recently proved in [28] followed by the PSPACEcompleteness result of Jan car [20] On the other hand, all other equivalences in van Glabbeek s spectrum are undecidable [17, 19]. BPP is the natural class of processes to investigate non interleaving equivalences, intended to capture true concurrent computations of a system. One of the bisimulationlike non interleaving equivalences is distributed bisimilarity [6] taking into account spatial distribution of a process. ....
H. Httel. Undecidable equivalences for basic parallel processes. In Proc. TACS'94, LNCS 789, pages 454--464, 1994.
A Polynomial-Time Algorithm for Deciding True Concurrency.. - Lasota (2002) (Correct)
.... bisimilarity for BPP and even for BPP , extension of BPP by communication, was given in [10] The PSPACE lower bound has been recently proved in [28] followed by the PSPACE completeness result of Jan car [20] On the other hand, all other equivalences in van Glabbeek s spectrum are undecidable [17, 19]. BPP is the natural class of processes to investigate non interleaving equivalences, intended to capture true concurrent computations of a system. One of the bisimulation like non interleaving equivalences is distributed bisimilarity [6] taking into account spatial distribution of a process. ....
H. Httel. Undecidable equivalences for basic parallel processes. In Proc. TACS'94, LNCS 789, pages 454--464, 1994.
A polynomial-time algorithm for deciding true concurrency.. - Lasota (2002) (Correct)
....infinite state systems. An elegant proof of decidability of bisimilarity for BPP and even for BPP , extension of BPP by communication, was given in [10] The PSPACE lower bound has been recently proved in [28] On the other hand, all other equivalences in van Glabbeek s spectrum are undecidable [18, 20]. BPP is a very natural class of processes to investigate non interleaving equivalences, intended to capture true concurrent computations of a system. One of the bisimulation like non interleaving equivalences is distributed bisimilarity [6] taking into account spatial distribution of a ....
H. Httel. Undecidable equivalences for basic parallel processes. In Proc. TACS'94, LNCS 789, pages 454--464, 1994.
Decidability of Strong Bisimilarity for Timed BPP - Lasota (2002) (1 citation) (Correct)
....composition. Strong bisimilarity [19] is a well accepted behavioural equivalence which often remains decidable for infinite state systems. An elegant proof of decidability of bisimilarity for BPP was given in [8] while all other equivalences in van Glabbeek s spectrum are undecidable in BPP [15, 17]. In order to deal with timing aspects of systems, process algebras were extended with an appropriate notion of time (see e.g. 20] 1] 14] 10] 9] 2] A substantial effort have also been directed toward defining a robust notion of equivalence taking performance into consideration, e.g. ....
H. Httel. Undecidable equivalences for basic parallel processes. In Proc. TACS'94, LNCS 789, pages 454--464, 1994.
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