Abstract. We present an exact characterization of those transition systems which can be equivalently (up to bisimilarity) defined by the syntax of normed BPA ...

Abstract. We compare the classes of behaviours (transition systems) which can be generated by normed BPAτ and normed BPPτ processes.

Summary. We present an exact characterization of those transition sys- tems which can be equivalently (up to bisimilarity) defined by the syntax of normed ...

Summary. We present an exact characterization of those transition sys- tems which can be equivalently (up to bisimilarity) defined by the syntax of normed ...

Comparing expressibility of normed BPA and normed BPP processes · I. Cerná, M. Kretínský, A. Kucera · Published in Acta Informatica 1 March 1999 · Computer Science.

An exact characterization of those transition systems which can be equivalently (up to bisimilarity) defined by the syntax of normed BPA andnormed BPP ...

Résumé: We present an exact characterization of those transition systems which can be equivalently (up to bisimilarity) defined by the syntax of normed ...

We present a polynomial-time algorithm deciding bisimilar- ity between a normed BPA process and a normed BPP process. ... Comparing expressibility of normed BPA.

We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known ...

We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O ( n 7 ) .