- Full text PDF available (7)
Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over LLTS, including usual process-algebraic operators, logic connectives (conjunction and disjunction) and standard temporal… (More)
Process algebra and temporal logic are two popular paradigms for the specification , verification and systematic development of reactive and concurrent systems. These two approaches take different standpoint for looking at specifications and verifications, and offer complementary advantages. In order to mix algebraic and logic styles of specification in a… (More)
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üttgen and Vogler in [TCS 373(1-2):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two logical constructors ∧ and ∨ over Logic LTSs are… (More)
This paper presents a pneumatic rubber microactuator which can be used in many fields such as the miniature endoscope inspection, the pipe inspection etc.. The actuating performance was analyzed using ANSYS. The results showed that the maximum stress was not on the position where the dimension mutated. And the end surface rotation angle was increasing… (More)
The parallel chip-firing game is an automaton on graphs in which vertices " fire " chips to their neighbors when they have enough chips to do so. In this work we first characterize positions that repeat every 2 turns. Using this we determine the eventual periods of games on trees given only the total number of chips. We introduce the concepts of motorized… (More)
It is shown that, for any equation X = RS t X in the LLTS-oriented process calculus CLL R , if X is strongly guarded in t X , then the recursive term X|X = t X is the greatest solution of this equation w.r.t Lüttgen and Vogler's ready simulation.
This paper explores the process calculus CLL R furtherly. First, we prove that for any equation X = RS t X such that X is strongly guarded in t X , X|X = t X is the largest solution w.r.t ⊑ RS. Second, we encode a fragment of action-based CTL in CLL R .
In the framework of logic labelled transition system, a variant of weak ready simulation has been presented by Lüttgen and Vogler. It has been shown that such behavioural preorder is the largest precongruence w.r.t parallel and conjunction composition satisfying desired properties. This paper offers a ground-complete axiomatization for this precongruence… (More)