Reduction of event structures under history preserving bisimulation
نویسندگان
چکیده
منابع مشابه
Reduction of event structures under history preserving bisimulation
Event structures represent concurrent processes in terms of events and dependencies between events modelling behavioural relations like causality and conflict. Since the introduction of prime event structures, many variants of event structures have been proposed based on different behavioural relations and thus providing a different expressive power. In particular, a single event in a more expr...
متن کاملOn Plain and Hereditary History-Preserving Bisimulation
We investigate the difference between two well-known notions of independence bisimilarity, history-preserving bisimulation and hereditary history-preserving bisimulation. We characterise the difference between the two bisimulations in trace-theoretical terms, advocating the view that the first is (just) a bisimulation for causality, while the second is a bisimulation for concurrency. We explore...
متن کاملHistory Preserving Bisimulation for Contextual Nets
We investigate the notion of history preserving bisimulation [15, 18, 3] for contextual P/T nets, a generalization of ordinary P/T Petri nets where a transition may check for the presence of tokens without consuming them (non-destructive read operations). A first equivalence, simply called HP-bisimulation, is based on Winskel’s prime event structures. A finer equivalence, called RHP-bisimulatio...
متن کاملDecomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and complete equational axiomatization for the equivalence. Both results are derived from a decomposition property of hhp-b, which is the main technical contribution of the paper. Altogether, our results complement previous work o...
متن کاملHereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
Hereditary history preserving bisimulation is a natural extension of bisimulation to the setting of so-called “true” concurrency. Somewhat surprisingly, this extension turns out to be undecidable, in general, for finite-state concurrent systems. In this paper, we show that for a substantial and useful class of finite-state concurrent systems— those whose semantics can be described in terms of M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2016
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2015.10.004