LTL synthesis is the process of generating a reactive finite-state system from a formal specification written in Linear Temporal Logic (LTL). The idea of synthesis is to automatically construct a functional correct system from a behavioral description of the system. Even though the idea is nearly fifty years old and the underlying theory is well established, is has not be adapted to practice ye...

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially di erent universes of such sets. The unisets of the rst universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular mult...

In this paper we introduce alternating automata for languages of arrows of an arbitrary category, and as an instantiation thereof alternating automata for graph languages. We study some of their closure properties and compare them, with respect to expressiveness, to other methods for describing graph languages. We show, by providing several examples, that many graph properties (of graphs of bou...

Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths. These quantifiers naturally extend to paths the concept of graded world modali...

In this paper, we propose a new tableau-based model checking technique for verifying dialogue game protocols for agent communication. These protocols are defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL...

It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata). A translation of LTL formulae into a language equivalent A1W automata has been introduced in [MSS88]. The inverse translation has been developed independently in [Roh97] and [LT00]. We improve the lat...

Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...

Game automata are known to recognise languages arbitrarily high in both the non-deterministic and alternating Rabin–Mostowski index hierarchies. Recently it was shown that for this class both hierarchies are decidable. Here we complete the picture by showing that the weak index hierarchy is decidable as well. We also provide a procedure computing for a game automaton an equivalent weak alternat...

Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative...

Quantitative questions such as “what is the maximum number of tokens in a place of a Petri net?” or “what is the maximal reachable height of the stack of a pushdown automaton?” play a significant role in understanding models of computation. To study such problems in a systematic way, we introduce structure transition systems on which one can define logics that mix temporal expressions (e.g. rea...