An error occurred while sending the email. Please try again.

Proceed reservation?

Proceed order?

Export
Filter
Collection
Language
Years
• 1
Book
Call number: 0330:118
Type of Medium: Book
Pages: xxi, 1460, x p.
Edition: 2., vollkommen überarbeitete und erw. Aufl.
ISBN: 3870971460 (Bd. I)
Language: Undetermined
Note: Bd. 1. Englisch-Deutsch.
Location: C120
Signatur Availability
Others were also interested in ...
• 2
Electronic Resource
Springer
Acta informatica 36 (1999), S. 233-256
ISSN: 1432-0525
Source: Springer Online Journal Archives 1860-2000
Topics: Computer Science
Notes: Abstract. We present an exact characterization of those transition systems which can be equivalently (up to bisimilarity) defined by the syntax of normed BPA $_\tau$ and normed BPP $_\tau$ processes. We give such a characterization for the subclasses of normed BPA and normed BPP processes as well. Next we demonstrate the decidability of the problem whether for a given normed BPA $_\tau$ process $\Delta$ there is some unspecified normed BPP $_\tau$ process $\Delta'$ such that $\Delta$ and $\Delta'$ are bisimilar. The algorithm is polynomial. Furthermore, we show that if the answer to the previous question is positive, then (an example of) the process $\Delta'$ is effectively constructible. Analogous algorithms are provided for normed BPP $_\tau$ processes. Simplified versions of the mentioned algorithms which work for normed BPA and normed BPP are given too. As a simple consequence we obtain the decidability of bisimilarity in the union of normed BPA $_\tau$ and normed BPP $_\tau$ processes.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
Close ⊗