Detail publikace

Composed Bisimulation for Tree Automata

Originální název

Composed Bisimulation for Tree Automata

Anglický název

Composed Bisimulation for Tree Automata

Jazyk

en

Originální abstrakt

We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata (TA) using suitable, language-preserving equivalences on the states of the automata. In particular, we propose the so-called composed bisimulation equivalence as a new language preserving equivalence. A composed bisimulation equivalence is defined in terms of two different relations, namely the upward and downward bisimulation equivalence. We provide simple and efficient algorithms for computing these relations. The notion of composed bisimulation equivalence is motivated by an attempt to obtain an equivalence that can provide better reductions than what currently known bisimulation-based approaches can offer, but which is not significantly more difficult to compute (and hence stays below the computational requirements of simulation-based reductions). The experimental results we present in the paper show that our composed bisimulation equivalence meets such requirements, and hence provides users of TA with a finer way to resolve the trade-off between the available degree of reduction and its cost.

Anglický abstrakt

We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata (TA) using suitable, language-preserving equivalences on the states of the automata. In particular, we propose the so-called composed bisimulation equivalence as a new language preserving equivalence. A composed bisimulation equivalence is defined in terms of two different relations, namely the upward and downward bisimulation equivalence. We provide simple and efficient algorithms for computing these relations. The notion of composed bisimulation equivalence is motivated by an attempt to obtain an equivalence that can provide better reductions than what currently known bisimulation-based approaches can offer, but which is not significantly more difficult to compute (and hence stays below the computational requirements of simulation-based reductions). The experimental results we present in the paper show that our composed bisimulation equivalence meets such requirements, and hence provides users of TA with a finer way to resolve the trade-off between the available degree of reduction and its cost.

BibTex


@article{BUT47978,
  author="Lukáš {Holík} and Tomáš {Vojnar} and Parosh {Abdulla} and Ahmed {Bouajjani} and Lisa {Kaati}",
  title="Composed Bisimulation for Tree Automata",
  annote="We address the problem of reducing the size of (nondeterministic, bottom-up) tree
automata (TA) using suitable, language-preserving equivalences on the states of
the automata. In particular, we propose the so-called composed bisimulation
equivalence as a new language preserving equivalence. A composed bisimulation
equivalence is defined in terms of two different relations, namely the upward and
downward bisimulation equivalence. We provide simple and efficient algorithms for
computing these relations. The notion of composed bisimulation equivalence is
motivated by an attempt to obtain an equivalence that can provide better
reductions than what currently known bisimulation-based approaches can offer, but
which is not significantly more difficult to compute (and hence stays below the
computational requirements of simulation-based reductions). The experimental
results we present in the paper show that our composed bisimulation equivalence
meets such requirements, and hence provides users of TA with a finer way to
resolve the trade-off between the available degree of reduction and its cost.",
  address="NEUVEDEN",
  chapter="47978",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  journal="International Journal of Foundations of Computer Science",
  number="4",
  volume="20",
  year="2009",
  month="august",
  pages="685--700",
  publisher="NEUVEDEN",
  type="journal article - other"
}