A Process Calculus with Logical Operators
In order to combine operational and logical styles of specifications in one unified framework, the notion of logic labelled transition systems (Logic LTS, for short) has been presented and explored by L"{u}ttgen and Vogler in [TCS 373(1-2):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two logical constructors $\wedge$ and $\vee$ over Logic LTSs are introduced to describe logical combinations of specifications. Hitherto such framework has been dealt with in considerable depth, however, process algebraic style way has not yet been involved and the axiomatization of constructors over Logic LTSs is absent. This paper tries to develop L"{u}ttgen and Vogler’s work along this direction. We will present a process calculus for Logic LTSs (CLL, for short). The language CLL is explored in detail from two different but equivalent views. Based on behavioral view, the notion of ready simulation is adopted to formalize the refinement relation, and the behavioral theory is developed. Based on proof-theoretic view, a sound and ground-complete axiomatic system for CLL is provided, which captures operators in CLL through (in)equational laws.
💡 Research Summary
This paper tackles the long‑standing gap between operational and logical specification styles by extending the framework of Logic Labeled Transition Systems (Logic LTS) with explicit logical constructors and by providing a full algebraic treatment of the resulting language. Lüttgen and Vogler previously introduced two logical operators, conjunction (∧) and disjunction (∨), on top of ordinary LTS in order to express logical combinations of specifications. While their work gave a solid semantic foundation, it left open the question of how to treat such systems from a process‑algebraic perspective and how to axiomatize the new operators.
The authors answer these questions by defining a new process calculus, called CLL (Calculus for Logic LTS). The syntax of CLL contains the usual process operators (action prefix, external choice, parallel composition, etc.) together with the logical constructors ∧ and ∨. The semantics is given in two complementary views.
Behavioral view. The paper adopts ready simulation as the refinement preorder. Ready simulation refines ordinary simulation by requiring that, besides matching each transition, the set of enabled actions (the “ready set”) of the simulating state must contain the ready set of the simulated state. This makes it particularly suitable for reasoning about logical combinations, because ∧‑terms must satisfy the ready sets of both components simultaneously, whereas �∨‑terms need only satisfy one of them. The authors prove that ready simulation is a precongruence for all CLL operators, and they derive specific simulation rules for ∧ and ∨ that capture their logical nature.
Proof‑theoretic view. The second contribution is a sound and ground‑complete axiomatic system AX for CLL. AX includes the usual algebraic laws (associativity, commutativity, identity, idempotence) for the standard operators, and it adds a suite of (in)equational laws governing the interaction of ∧, ∨, and ready simulation. Notable among these are De Morgan‑type identities, distributivity of ∧ over ∨ and vice‑versa, and equations that express how ready simulation distributes over logical constructors. The system is shown to be sound: every derivable (in)equation holds under the ready‑simulation semantics.
The most technically demanding part is the proof of ground‑completeness. The authors introduce a normal‑form transformation that systematically rewrites any closed CLL term into a canonical shape consisting of a finite sum of guarded basic processes combined with ∧ and ∨ in a restricted pattern. They then prove that two normal forms are ready‑simulation equivalent if and only if they are provably equal in AX. This establishes that AX can derive all true equations between closed terms, i.e., it is complete for the ground fragment of the language.
Beyond the core results, the paper discusses expressiveness, showing that CLL can encode a wide range of specification patterns that were cumbersome or impossible to express in plain LTS, such as “the system must be able to perform both a and b concurrently” (using ∧) or “the system may behave either as X or as Y” (using ∨). The authors also outline possible extensions, including infinite‑state systems, probabilistic transitions, and timed behaviours, and they suggest that the axiomatization could serve as a basis for automated theorem provers or model‑checking tools that need to handle logical combinations of specifications.
In summary, the paper delivers a unified framework that merges operational and logical specification techniques. By introducing logical operators into the transition‑system model, defining a ready‑simulation based refinement, and providing a sound, ground‑complete equational theory, it equips researchers and practitioners with both semantic and syntactic tools for rigorous specification, refinement, and verification of complex concurrent systems.