5 search results - page 1 / 1 » Bisimulation and Other Undecidable Equivalences for Lossy Ch... |
TACS
2001
Springer
13 years 9 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 8 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
1999
Springer
13 years 8 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
CADE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
LICS
1993
IEEE
13 years 8 months ago
1993
IEEE
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...