Conjunction on processes: Full abstraction via ready-tree semantics

AbstractA key problem in mixing operational (e.g. process-algebraic) and declarative (e.g. logical) styles of specification is how to deal with inconsistencies arising when composing processes under conjunction. This article introduces a conjunction operator on labelled transition systems capturing the basic intuition of ‘a and b = false’, and considers a naive preorder that demands that an inconsistent specification can only be refined by an inconsistent implementation.The main body of the article is concerned with characterizing the largest precongruence contained in the naive preorder. This characterization will be based on what we call ready-tree semantics, which is a variant of path-based possible-worlds semantics. We prove that the induced ready-tree preorder is compositional and fully abstract, and that the conjunction operator indeed reflects conjunction.The article’s results provide a foundation for, and an important step towards a unified framework that allows one to freely mix operators from process algebras and linear-time temporal logics