Processes with local and global liveness requirements

Guerra, Hélia; Costa, José Félix

doi:10.1016/j.jlap.2008.08.003

Cited by 4 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature, various work on combining operational operators with logic operators have been reported [33,41,50]. Olderog provides a framework in which operational operators may be combined with trace formula [50].…”

Section: • ϕ ≡ Ttmentioning

confidence: 99%

“…But such framework does not allow one to freely mix operational and logic specifications. Guerra and Costa enrich a simple process algebra with a modal operator which can express some liveness property [33]. However, due to adopting trace semantics, this system is not deadlock-sensitive, and hence it is inadequate in the situation where concurrency is involved.…”

Section: • ϕ ≡ Ttmentioning

confidence: 99%

See 1 more Smart Citation

Merging Process Algebra and Action-based Computation Tree Logic

Zhu¹,

Zhang²,

Zhang³

2012

Preprint

View full text Add to dashboard Cite

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 uniform framework, the notion of a logic labelled transition system (LLTS) has been presented and explored by Lüttgen and Vogler. This paper intends to propose a LLTS-oriented process calculus which, in addition to usual process-algebraic operators, involves logic connectives (conjunction and disjunction) and standard temporal operators (always and unless). This calculus preserves usual properties of these logic operators, allows one to freely mix operational and logic operators, and supports compositional reasoning. Moreover, the links between this calculus and Action-based Computation Tree Logic (ACTL) including characteristic formulae of process terms, characteristic processes of ACTL formulae and Galois connection are explored.

show abstract

Section: • ϕ ≡ Ttmentioning

confidence: 99%

Section: • ϕ ≡ Ttmentioning

confidence: 99%

Merging Process Algebra and Action-based Computation Tree Logic

Zhu¹,

Zhang²,

Zhang³

2012

Preprint

View full text Add to dashboard Cite

show abstract

“…Thus, and in contrast to our present work, [28] does not support the unrestricted mixing of operational and logic specification styles, which can be very useful as, e.g., demonstrated by our example in Section 4. In [29], a mixing of process-algebraic and temporal-logic operators is advocated by Guerra and Costa, too: a simple process algebra is extended with an operator to express that eventually some action occurs (see also [30]). Again, the semantics is based on traces and is thus not deadlock-sensitive.…”

Section: Related Workmentioning

confidence: 99%

Safe reasoning with Logic LTS

Lüttgen

Vogler

2011

Theoretical Computer Science

View full text Add to dashboard Cite

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.

show abstract

Safe Reasoning with Logic LTS

Lüttgen

Vogler

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Processes with local and global liveness requirements

Cited by 4 publications

References 20 publications

Merging Process Algebra and Action-based Computation Tree Logic

Merging Process Algebra and Action-based Computation Tree Logic

Safe reasoning with Logic LTS

Safe Reasoning with Logic LTS

Contact Info

Product

Resources

About