𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the complexity of deciding bisimilarity of normed unary processes

✍ Scribed by Dung T. Huynh; Lu Tian

Book ID
107948832
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
545 KB
Volume
131
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of bisimilarity-checking
The complexity of bisimilarity-checking for one-counter processes
✍ AntonΔ±́n Kučera πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 376 KB

We study the problem of bisimilarity-checking between processes of one-counter automata and ΓΏnite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are 'restricted' one-counter automata where the counter cannot be tested for zero) and ΓΏnite-state p

A note on the decidability of exponentia
A note on the decidability of exponential terms
✍ Paola D'Aquino; Giuseppina Terzo πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract In this paper we prove, modulo Schanuel's Conjecture, that there are algorithms which decide if two exponential polynomials in Ο€ are equal in ℝ and if two exponential polynomials in Ο€ and __i__ coincide in β„‚. (Β© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)