Search

• < Previous
• 1
• Next >

---

Covering and separation for logical fragments with modular predicates

Thomas Place ; Varun Ramanathan ; Pascal Weil.

For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first language, while being disjoint from the second one. Usually, finding&nbsp;[&hellip;]

---

On logical hierarchies within FO^2-definable languages

Manfred Kufleitner ; Pascal Weil.

We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier alternations yields an infinite hierarchy whose levels are&nbsp;[&hellip;]

---

Asynchronous wreath product and cascade decompositions for concurrent behaviours

Bharat Adsul ; Paul Gastin ; Saptarshi Sarkar ; Pascal Weil.

We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events, and can be said to support true concurrency.&nbsp;[&hellip;]

---