Search

• < Previous
• 1
• Next >

---

Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy&#39;s Merge

Luca Aceto ; Wan Fokkink ; Anna Ingolfsdottir ; Bas Luttik.

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner's&nbsp;[&hellip;]

---

Rule Formats for Nominal Process Calculi

Luca Aceto ; Ignacio Fábregas ; Álvaro García-Pérez ; Anna Ingólfsdóttir ; Yolanda Ortega-Mallén.

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated&nbsp;[&hellip;]

---

On the Axiomatisability of Parallel Composition

Luca Aceto ; Valentina Castiglioni ; Anna Ingolfsdottir ; Bas Luttik ; Mathias R. Pedersen.

This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process algebra BCCSP over a finite set of actions, we provide&nbsp;[&hellip;]

---

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Luca Aceto ; Ian Cassar ; Adrian Francalanza ; Anna Ingolfsdottir.

Runtime enforcement is a dynamic analysis technique that instruments a monitor with a system in order to ensure its correctness as specified by some property. This paper explores bidirectional enforcement strategies for properties describing the input and output behaviour of a system. We develop an&nbsp;[&hellip;]

---

Complexity results for modal logic with recursion via translations and tableaux

Luca Aceto ; Antonis Achilleos ; Elli Anastasiadi ; Adrian Francalanza ; Anna Ingólfsdóttir.

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations to and from the $\mu$-calculus and modal&nbsp;[&hellip;]

---