Jan 3, 2024 · We compare, in terms of expressive power, two notions of automata recognizing finite N-free pomsets: branching automata by Lodaya and Weil [7, 8 ...

We compare, in terms of expressive power, two notions of automata recognizing finite N-free pomsets: branching automata by Lodaya and Weil [Lodaya and Weil, ...

Jan 2, 2024 · Pomsets provide a more compact alternative by using a partial order to explicitly represent causality and concurrency between these actions.

Dec 21, 2023 · Typical models are based on languages or automata over sending and receiving actions. Pomsets provide a more compact alternative by using a ...

Pomsets are a model of concurrent computations introduced by Pratt. They can provide a syntax- oblivious description of semantics of coordination models ...

There exist two types of automata recognizing finite N-free pomsets: the branching automata [76] [77] [78] [79] and the pomset automata [80] [81] , and in ...

Compared to automata and traditional sets of pomsets, BPs supply additional structure in respectively concurrency and choices, yielding a more compact model.

Aug 9, 2022 · This paper proposes an extension of pomsets, named branching pomsets, with a branching structure that can represent Alice's behaviour using 2 + 2 + 2 ordered ...

In this example, we define a branching automaton with costs A whose behavior measures the height of a pomset, i.e., (S(A),t) = height(t) for any sp-pomset t.

recognizable pomset languages is not closed under complementation. Lodaya and Weil [11–13] define branching automata that can accept series–parallel pomsets.