17 search results - page 3 / 4 » Decidability of Bisimulation Equivalence for Normed Pushdown... |
ICALP
1997
Springer
15 years 1 months ago
1997
Springer
CONCUR
1992
Springer
15 years 1 months ago
1992
Springer
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
95
Voted
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
FMCO
2005
Springer
15 years 3 months ago
2005
Springer
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...