36 search results - page 2 / 8 » Bisimulation Equivalence is Decidable for all Context-Free P... |
CONCUR
2008
Springer
13 years 7 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
MFCS
1998
Springer
13 years 10 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
TACS
2001
Springer
13 years 10 months ago
2001
Springer
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
ICALP
1998
Springer
13 years 10 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
ICALP
1997
Springer
13 years 10 months ago
1997
Springer
