R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal of Computing, 16(6):973-989, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Undecidability of Domino Games - And Hhp-Bisimilarity Marcin (Correct)
....see for example the overview note [21] Let us illustrate this on the examples of nite transition systems and a class of in nite state transition systems generated by context free grammars. For nite transition systems there are very ecient polynomial time algorithms for checking bisimilarity [17, 24], in sharp contrast to PSPACEcompleteness of the classical language equivalence. For transition systems generated by context free grammars, while language equivalence is undecidable, bisimilarity is decidable [4] and if the grammar has no redundant nonterminals, even in polynomial time [13] ....
Robert Paige and Robert E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
A Proof System for Information Flow Security - Bossi, Focardi, Piazza, Rossi (2002) (1 citation) (Correct)
....these techniques can be fully automatized if the labelled transition system, i.e. the automata representing the operational behavior of the considered system, is composed of a nite number of states. In particular, there exist ecient algorithms for checking bisimulation equivalences (see, e.g. [4, 14, 22, 7]) which are polynomial with respect to the number of states and transitions of the underlying transition system. However this kind of behavioral veri cation often su ers of the so called state explosion problem, i.e. the number of states increases exponentially with respect to the degree of ....
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
Combining Optimizations, Combining Theories - Veldhuizen, Siek (Correct)
....Alpern Wegman Zadeck (AWZ) algorithm [AWZ88] In this approach, variable de nitions in an SSA form program are viewed as a set of corecursive de nitions, and Hopcroft s DFAminimization algorithm [Hop71] is used to nd a maximal congruence. This approach is based on partition re nement (e.g. PT87] in which all variables are initially assumed equal and are moved into separate partitions as inequalities are discovered. DFA minimization is the canonical example of bisimulation in coalgebra e.g. Rut98,Kur01] Clearly, the congruence found by the AWZ algorithm is a bisimulation, and has a ....
Robert Paige and Robert E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, December 1987.
An Efficient Algorithm for Computing Bisimulation Equivalence - Dovier, Piazza, Policriti (Correct)
....a given nite state automaton: the problem is equivalent to that of determining the coarsest partition of a set stable with respect to a nite set of functions. A variant of this problem is studied in [PTB85] where it is shown how to solve it in linear time in case there is only one function. In [PT87] Paige and Tarjan solved the problem in the general case in which the stability requirement is relative to a relation E (on a set N) with an algorithm whose complexity is O(jEj log jN j) The main feature of the linear solution to the single function coarsest partition problem (cf. PTB85] is ....
....in its use of a clever ordering (the so called process the smallest half ordering) for processing classes that must be used in a split step. Starting from an adaptation of Hopcroft s idea to the relational coarsest partition problem, Paige and Tarjan succeeded in obtaining their fast solution [PT87] In this paper we present a procedure that integrates positive and negative strategies to obtain the algorithmic solution to the bisimulation problem and hence to the relational coarsest partition problem. The strategy we develop is driven by the set theoretic notion of rank of a set. The ....
[Article contains additional citation context not shown here]
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
State Class Constructions for Branching Analysis of Time.. - Berthomieu, Vernadat (2003) (1 citation) (Correct)
....property. Their algorithm enforces (EE) AE) and (EA) It is easily shown that (AE) and (EE) imply bisimilarity with the state graph. Maintaining (EA) is unnecessary however. Bisimulations can be computed with an algorithm initially aimed at solving the relational coarsest partition problem [PT87] Let be a binary relation over a nite set U , and for any S U , let S = fxj(9y 2 S) x y)g. A partition P of U is stable if, for any pair (A; B) of blocks of P , either A B or A B = A is said stable wrt B) Computing a bisimulation, starting from an initial partition P of ....
.... y)g. A partition P of U is stable if, for any pair (A; B) of blocks of P , either A B or A B = A is said stable wrt B) Computing a bisimulation, starting from an initial partition P of states, is computing a stable re nement Q of P [KS90,ACH 96] An algorithm is the following [PT87] Initially : Q = P while there exists A; B 2 Q such that ; 6 A B 6 A do replace A by A 1 = A B and A 2 = A B in Q So, building a graph of atomic classes from the SSCG is computing a stable re nement of it. Our algorithm is based on the above, di erences include: As timed ....
P. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973989, 1987.
Simulation as Coarsest Partition Problem - Gentilini, Piazza, Policriti (2002) (1 citation) (Correct)
....to be useful to establish a connection between simulations and partition problems. We are now ready to introduce the Generalized Coarsest Partition Problem. We call it generalized because we are not only going to deal with partitions to be re ned (as in the classical coarsest partition problems [16, 15, 12]) but with pairs in which we have a partition and a relation over the partition. De nition 7. Let G = hN; Ei be a nite graph. A partition pair over G is a pair h ; P i in which is a partition over N , and P 2 is a re exive and acyclic relation over . Notice that a labelled graph G = ....
.... j) As far as the remaining operations in the for loop is concerned, we observe that, for each class 2 i 1 with E 1 ( 6= the sets 1 = E 1 ( and 2 = 1 can be provided while computing (i.e. at the cost of computing) Split( strategies similar to the ones suggested in [15] can be used to this porpouse. For loop s instructions involving the updating of i 1 and the setting of the Stable sets (relative to the new i 1 classes) can be straightfully implemented in O(1) Thus the global cost of the for loop in a re ning step turn out to be O(E 1 ( 1 )j i j : ....
R. Paige and R. E. Tarjan. Three partition renement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
The Concurrency Workbench of the New Century, Version 1.2.. - Cleaveland, Li, Sims (2000) (Correct)
....capture di erent notions of behaving the same. In a second approach is de ned as a preorder (i.e. a relation that is re exive and transitive) and hSys; Speci 2 indicates that Sys behaves the same or better than Spec. Ecient algorithms have been developed for equivalence and preorder checking [24, 5] and routines for performing these types of veri cation have been implemented in the CWB NC. The CWB NC provides appropriate diagnostic information for explaining why two systems fail to be related by a given semantic equivalence or preorder. The design of the system exploits the ....
R. Paige and R.E. Tarjan. Three partition renement algorithms. SIAM Journal of Computing, 16(6):973-989, December 1987.
Ecient Veri - Cation Of Sequential (Correct)
No context found.
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal of Computing, 16(6):973-989, 1987.
Probabilistic Weak Simulation is Decidable in Polynomial Time - Baier, Hermanns, Katoen (2004) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. SIAM J. on Comp., 16(6): 973-989, 1987.
Timed Process Description Languages Based on CCS - GRUSKA, MAGGIOLO-SCHETTINI (1991) (Correct)
No context found.
R. Paige and R. Tarjan. Three Partition Re nement Algorithms. SIAM Journal on Computing 16(1987), pp. 973-989.
Strongly orderable graphs - A common generalization of strongly.. - Dragan (2001) (Correct)
No context found.
R. Paige, R.E. Tarjan, Three partition re#nement algorithms, SIAM J. Comput. 16 (1987) 973--989.
Decision Algorithms for Probabilistic Bisimulation - Cattani, Segala (2002) (2 citations) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. SIAM J. Comput., 16(6):973-989, 1987.
An Efficient Algorithm for Branching Bisimulation and.. - Groote, Vaandrager (1990) (24 citations) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
Data Structures for Maintaining Set Partitions - Bender, Sethia, Skiena (2003) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. SIAM J. Computing, 16(6):973-989, Dec. 1987.
A Simple Linear Time Algorithm for Cograph Recognition - Habib, Paul (2001) (Correct)
No context found.
R. Paige and R.E. Tarjan. Three partition re nement algorithms. SIAM Journ. of Comput., 16(6):973989, 1987.
Decision Algorithms for Probabilistic Bisimulation - Cattani, Segala (2002) (2 citations) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. SIAM J. Comput., 16(6):973-989, 1987.
Automated Compositional Abstraction Refinement for.. - Chaki, Ouaknine.. (2003) (Correct)
No context found.
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal of Computing, 16(6):973-989, 1987.
Efficient Verification of Sequential and Concurrent C.. - Chaki, Clarke, Groce, .. (2003) (1 citation) (Correct)
No context found.
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal of Computing, 16(6):973-989, 1987.
Verifying Persistent Security Properties - Bossi, Focardi, Piazza, Rossi (Correct)
No context found.
R. Paige, R. E. Tarjan, Three Partition Re nement Algorithms, SIAM Journal on Computing 16 (6) (1987) 973-989.
Automated compositional Markov chain generation for a.. - Hermanns, Katoen (2000) (10 citations) (Correct)
No context found.
R. Paige, R. Tarjan, Three partition re#nement algorithms, SIAM J. Comput. 16(6) (1987) 973--989.
Data Structures for Maintaining Set Partitions - Bender, Sethia, Skiena (2002) (Correct)
No context found.
R. Paige and R. Tarjan. Three partition re nement algorithms. In SIAM J. Computing, pages 16:973-989, 1987.
Proofs Methods for Bisimulation Based Information Flow.. - Focardi, Piazza, Rossi (2002) (Correct)
No context found.
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
A Proof System for Information Flow Security - Annalisa Bossi Riccardo (2002) (1 citation) (Correct)
No context found.
R. Paige and R. E. Tarjan. Three Partition Re nement Algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
Iterating Transducers - Dennis Dams Yassine (2001) (4 citations) (Correct)
No context found.
R. Paige and R. E. Tarjan. Three partition re nement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
Rank-Based Symbolic Bisimulation (and Model Checking) - Dovier, Gentilini, Piazza, .. (2002) (Correct)
No context found.
Paige, R. and R. E. Tarjan, Three partition re nement algorithms, SIAM Journal on Computing 16 (1987), pp. 973-989.
First 50 documents
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