Name
Abstract | ||
|---|---|---|
. We consider the factorization (collapse) of infinite transitiongraphs wrt. bisimulation equivalence. It turns out that almost noneof the more complex classes of the process taxonomy, which has beenestablished in the last years, are preserved by this operation. However,for the class of BPA graphs (i.e. prefix transition graphs of context-freegrammars) we can show that the factorization is effectively a regulargraph, i.e. finitely representable by means of a deterministic hypergraph... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-61604-7_59 | CONCUR |
Keywords | Field | DocType |
process taxonomy,bisimulation collapse,complexity class | Factor graph,Discrete mathematics,Combinatorics,Hypergraph,Decidability,Prefix,Regular graph,Bisimulation,Factorization,Corollary,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-61604-7 | 33 | 1.68 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Burkart | 1 | 287 | 36.17 |
| Didier Caucal | 2 | 470 | 39.15 |
| Bernhard Steffen | 3 | 4239 | 423.70 |