Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract)
نویسندگان
چکیده
We consider the veriication of a class of innnite-state systems called lossy channel systems, which consist of nite-state processes communicating via unbounded but lossy FIFO channels. This class is able to model several interesting protocols, such as HDLC, the Alternating Bit Protocol, and other Sliding Window protocols. In earlier papers we have considered the decidability of various temporal properties for lossy channel systems. In this paper we study simulation and bisimulation relations between lossy channel systems and nite transition systems. More precisely, we show the decidability of (1) whether a state in a nite transition system simulates a state in a lossy channel system, and conversely, (2) whether a state in a nite transition system is bisimilar to a state in a lossy channel system, and (3) whether a state in a nite transition system weakly simulates a state in a lossy channel system. Furthermore, we show the undecidability of the following problems: (1) whether a state in a lossy channel system weakly simulates a state in a nite transition system, and (2) Whether a state in a nite transition system is weakly bisimilar to a state in a lossy channel system.
منابع مشابه
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
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 systems is whether bisimulation is decidable. We show that bisimulation, simulation, and in fact all relations between bisimulation and trace inclusion are undecidable for lossy channel systems (and for lossy vector addit...
متن کاملModal Process Rewrite Systems
We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining p...
متن کاملSimulation Preorder over Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinitestate processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulat...
متن کاملSimulation Preorder on Simple Process Algebras
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 simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...
متن کاملDeciding Bisimulation-Like Equivalences with Finite-State Processes
We design a general method for proving decidability of bisimulationlike equivalences between infinite-state processes and finite-state ones. We apply this method to the class of PAD processes, which strictly subsumes PA and pushdown (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-stat...
متن کامل