Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is handled ...

Nov 29, 2004 · Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel ...

Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is handled ...

Abstract. Costs in word or tree automata are calculated by means of a semi- ring. The costs along a path are multiplied, and then the costs of all ...

Jun 24, 2003 · Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel ...

Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is ...

Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is ...

Abstract. This paper addresses questions regarding the decidability of hybrid automata that may be built hierarchically as is the case in many exemplar ...

Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is ...

Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. D. Kuske, and I. Meinecke. CIAA, volume 2759 of Lecture Notes in Computer Science ...