2 search results - page 1 / 1 » Bisimilarity Is Not Finitely Based over BPA with Interrupt |
71
Voted
CALCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...