Towards characterizing bisimilarity of value-passing processes with context-free control
نویسنده
چکیده
A value-passing version of normed context-free processes is considered, where process behaviours depend on a global state of data variables. The problem of characterizing bisimilarity of such processes is posed. A solution of the formulated problem is presented for a restricted class of processes and possibilities of extending the result are discussed. The presented solution exploits a tableau decision method for pure, normed, context-free processes: based on a tableau, a system of implications is formulated, solution of which characterizes bisimulation equivalence for a pair of value-passing processes.
منابع مشابه
Characterizing bisimilarity of value-passing parametrised processes
Symbolic transition graphs of Hennessy and Lin extended with assignments are considered. Semantics appealing to the notion of state is introduced for the symbolic transition graphs and their extended version. Showing strong early bisimulation between so represented value-passing processes is reduced to nding a solution of a set of equations involving state formulas.
متن کاملA complexity analysis of bisimilarity for value-passing processes
We study the complexity of deciding bisimilarity between non-deterministic processes with explicit primitives for manipulating data values. In particular, we consider a language with value-passing (input/output of data) and parametric deenitions of processes. We distinguish the case in which data cannot be tested and the case in which a simple equality test over data is permitted. In the rst ca...
متن کاملDeadlocking States in Context-Free Process Algebra
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 these processes with a deadlocking state into BPAδ systems. Bosscher has proved that bisimilarity and regularity remain decidable [Bos97]. We generalise his approach introducing strict and nonstrict version of bisimila...
متن کاملContext-free Process Algebras Extended with Deadlocks
Recently it has been shown that the class of BPA (or context-free) processes can be widely used to describe sequential processes and to define their semantics. This class has been intensively studied. Bisimilarity and regularity appeared to be decidable within the BPA processes (see [CHS95], [BCS96]). We extend these processes with a deadlocking state into BPA systems. We show that the BPA clas...
متن کاملDecidability of Behavioural Equivalences in Process Calculi with Name Scoping
Local channels and their name scoping rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 18 شماره
صفحات -
تاریخ انتشار 1998