S. Lasota  Home/Search
Context Related
| lsv.enscachan.fr/...lsv200213.rr.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsv.enscachan....blisy3all.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A polynomial-time algorithm is presented to decide distributed bisimilarity of Basic Parallel Processes. As a direct conclusion, several other noninterleaving semantic equivalences are also decidable in polynomial time for this class of process, since they coincide with distributed bisimilarity. (Update)
Context of citations to this paper: More
...3. Const( Const( and for each X 2 Const( X; X; The proof is given in Appendix A and in the full version [26]. The strong bisimilarity is defined w.r.t. single derivative transitions P P obtained by the rules (2) when distribution of a process is...
...3. Const( Const( and for each X 2 Const( X; X; The proof is given in Appendix A and in the full version [26]. Strong bisimilarity is defined w.r.t. single derivative transitions P P obtained by the rules (2) when the distribution of a process is ignored...
Cited by: More
A Polynomial-Time Algorithm for Deciding True - Concurrency Equivalences Of (Correct)
A Polynomial-Time Algorithm for Deciding True Concurrency.. - Lasota (2002) (Correct)
Active bibliography (related documents): More All
0.7: Decidability of Strong Bisimilarity for Timed BPP - Lasota (2002) (Correct)
0.5: On Coincidence of Distributed and Performance Equivalence for.. - Lasota (2002) (Correct)
0.4: Observing Distribution in Processes: Static and Dynamic Localities - Castellani (1994) (Correct)
Similar documents based on text: More All
1.2: The Power of Reachability Testing for Timed Automata - Aceto, Bouyer.. (2001) (Correct)
1.1: Model checking CTL+ is hard - Laroussinie, Markey, Schnoebelen (2000) (Correct)
1.1: A Parametric Analysis of the State Explosion Problem.. - Demri, Laroussinie.. (2001) (Correct)
Related documents from co-citation: More All
2: Equivalence Notions for Concurrent System and Refinement of Actions (context) - Goltz, van Glabbeek - 1989
2: Verifying performance equivalence for timed Basic Parallel Processes (context) - Brard, Labroue et al. - 2000
2: Deciding true concurrency equivalences on safe (context) - Jategaonkar, Meyer - 1996
BibTeX entry: (Update)
S. Lasota. A polynomial-time algorithm for deciding true concurrency equivalences of Basic Parallel Processes. Research Report LSV-02-13, LSV, ENS de Cachan, France, 2002. http://citeseer.ist.psu.edu/article/lasota02polynomialtime.html More
@misc{ for-unknown,
title = "A Polynomial-Time Algorithm For Deciding True Concurrency Equivalences of Basic Parallel Processes",
author = "S. Lasota",
year = 2002,,
url = "citeseer.ist.psu.edu/article/lasota02polynomialtime.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
71 Decidability and Decomposition (context) - Christensen - 1993
69 Causal trees (context) - Darondeau, Degano - 1989
69 Information and Computation (context) - Joyal, Nielsen et al. - 1996
58 Equivalence notions for concurrent systems and refinement of.. (context) - van Glabbeek, Goltz - 1989
40 Bisimulation equivalence is decidable for Basic Parallel Pro.. (context) - Christensen, Hirshfeld et al. - 1993
29 Petri nets and the equivalence problem (context) - Hirshfeld - 1993
23 A theory of processes with durational actions - Gorrieri, Roccetti et al. - 1995
23 Process algebras with localities (context) - Castellani - 2001
20 Partial ordering descriptions and observations of nondetermi.. (context) - Degano, De Nicola et al. - 1989
19 Hereditary history preserving bisimulation or what is the po.. - Bednarczyk - 1991
18 A polynomial time algorithm for deciding bisimulation equiva.. - Hirshfeld, Jerrum et al. - 1996
14 Deciding true concurrency equivalences on safe (context) - Jategaonkar, Meyer - 1996
9 causal and mixed-ordering equivalence over stable event stru.. (context) - Aceto - 1992
9 the decidability of non-interleaving process equivalences - Hennesy, Kiehn - 1994
8 Bisimulations for Concurrency (context) - Castellani - 1988
6 Distributed bisimilarity is decidable for a class of infinit.. (context) - Christensen - 1992
6 Strong bisimilarity and regularity of Basic Parallel Process.. (context) - Srba - 2002
5 Verifying performance equivalence for timed Basic Parallel P.. (context) - Brard, Labroue et al. - 2000
5 temporal and causal observations of simple processes (context) - Aceto - 1992
4 Deciding bisimilarity is P-complete (context) - Balczar, Gabarr et al. - 1992
4 Undecidable equivalences for basic parallel processes (context) - Httel - 1994
3 Hereditary history preserving bisimilarity is undecidable (context) - nski, Nielsen
3 Decidability of plain and hereditary history-preserving bisi.. (context) - Frschle - 1999
3 A note on distributed bisimulations (context) - Kiehn - 1999
3 On coincidence of distributed and performance equivalence fo.. - Lasota - 2002
2 Axiomatizing finite concurrent processes (context) - Hennesy - 1988
1 Behaviour structures and nets (context) - Rabinowich, Trakhtenbrot - 1988
Documents on the same site (http://www.lsv.ens-cachan.fr/Publis/publis-y3-all.php): More
Randomized Finite-State Distributed Algorithms As Markov Chains - Duflot, al. (2001) (Correct)
Verification of Embedded Reactive Fiffo Systems - Herbreteau, Cassez, Finkel, al. (2002) (Correct)
A Kleene/Büchi-like Theorem for Clock Languages - Bouyer, Petit (2001) (Correct)
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