Most computer scientists realize that just about every aspect of their subject involves fixed
points. To list but a few familiar examples, context-free grammars are nothing but a system of …

In the ambient logic of classical second order propositional calculus, we solve the
specification problem for a family of excluded middle like tautologies. These are shown to be …

This chapter provides an overview of the addition of various forms of iteration, ie, recursive
operations, to process algebra. Of these operations,(the original, binary version of) the …

The article reviews the various ways sequential composition is defined in traditional process
calculi, and shows that such definitions are not optimal, thus limiting the dissemination of …

In this paper we continue the study of a strict extension of the Computation Tree Logic,
called graded-CTL, recently introduced by the same authors. This new logic augments the …

Resource bisimilarity has been proposed in the literature on concurrency theory as a notion
of bisimilarity over labeled transition systems that takes into account the number of choices …

We provide a finite equational axiomatization for bisimulation equivalence of
nondeterministic interpretation of regular expressions. Our axiomatization is heavily based …

The logical characterization of the strong and the weak (ignoring silent actions) versions of
resource bisimulation are studied. The temporal logics we introduce are variants of …

The equational properties of the least fixed point operation on (ω-) continuous functions on
(ω-) complete partially ordered sets are captured by the axioms of iteration algebras, or …

The (in) equational properties of the least fixed point operation on (ω‐) continuous functions
on (ω‐) complete partially ordered sets are captured by the axioms of (ordered) iteration …