Safe reasoning with Logic LTS

Abstract

a b s t r a c tPrevious work has introduced the setting of Logic Labelled Transition Systems, called Logic LTS or LLTS for short, together with a variant of ready simulation as its fully-abstract refinement preorder, which allows one to compose operational specifications using a CSPstyle parallel operator and the propositional connectives conjunction and disjunction.In this article, we show how a temporal logic for specifying safety properties may be embedded into LLTS so that (a) the temporal operators are compositional for ready simulation; (b) ready simulation, when restricted to pairs of processes and formulas, coincides with the logic's satisfaction relation; (c) ready simulation, when restricted to formulas, is entailment.The utility of this setting as a semantic foundation for mixed operational and temporallogic specification languages is demonstrated by means of a simple example. We also adopt the concept of may-and must-transitions from modal transition systems for notational convenience, and investigate the relation between modal refinement on modal transition systems and ready simulation on LLTS.

The Exploration of Promoting Campus Culture Construction with Campus Sign Design Taking Nanjing University of Aeronautics and Astronautics as an Example

“…It is well-known that process algebra and temporal logic take different standpoint for looking at specifications and verifications of reactive and concurrent systems, and offer complementary advantages [21]. To take advantage of these two paradigms when designing systems, a few theories for heterogeneous specifications have been proposed, e.g., [7,8,10,12,15,16,17,20]. Among them, Lüttgen and Vogler propose the notion of logic labelled transition system (Logic LTS or LLTS for short), which combines operational and logical styles of specification in one unified framework [15,16,17].…”

“…To take advantage of these two paradigms when designing systems, a few theories for heterogeneous specifications have been proposed, e.g., [7,8,10,12,15,16,17,20]. Among them, Lüttgen and Vogler propose the notion of logic labelled transition system (Logic LTS or LLTS for short), which combines operational and logical styles of specification in one unified framework [15,16,17]. In particular, a variant of weak ready simulation has been presented in [16], which is adopted to capture refinement relation between processes in the presence of logical operators.…”

“…It has been shown that such simulation is the largest precongruence w.r.t parallel and conjunction satisfying desired properties [16]. Moreover, in addition to usual process operators (e.g., CSP-style parallel composition, hiding, etc) and logic operators (disjunction and conjunction), some standard temporal logic operators, such as "always"and "unless", are also integrated into this framework [17]. In a word, Lüttgen and Vogler offer a framework which allows ones to freely mix operational and logic operators when designing systems.…”

Modal Interface Automata

“…On the theoretical side, we firstly wish to study MIA's expressiveness in comparison to other theories via thoroughness [FFELS09]. More substantially, however, we intend to enrich MIA with temporal-logic operators, in the spirit of truly mixing operational and temporal-logic styles of specification in the line of our Logic LTS in [LV11]. Important guidance for this will be the work of Feuillade and Pinchinat [FP07], who have introduced a temporal logic for modal interfaces that is equally expressive to MTS.…”

“…Important guidance for this will be the work of Feuillade and Pinchinat [FP07], who have introduced a temporal logic for modal interfaces that is equally expressive to MTS. In contrast to [LV11], their setting is not mixed, does not consider nondeterminism, and does not include a refinement relation. Indeed, a unique feature of Logic LTS is that its refinement relation subsumes the standard temporal-logic satisfaction relation.…”