Timed automata are a usual model for the specification of real time systems. Their determinization is a key issue for several problems such as implementability, diagnosis or test generation. There exist non-determinizable timed automata and, unfortunately, determinizability of timed automata is an undecidable problem. Recently, two approaches have been proposed: a determinization procedure [2] ...

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative probabilistic systems. We provide a sufficient condition under which a logical semantics coincides with the trace semantics obtained via a given determin...

By separating the principal acceptance mechanism from the concrete acceptance condition of a given Büchi automaton with n states, Schewe presented the construction of an equivalent deterministic Rabin transition automaton with o((1.65n)n) states via history trees, which can be simply translated to a standard Rabin automaton with o((2.26n)n) states. Apart from the inherent simplicity, Schewe’s c...

We introduce a new formalism called automata over a timed domain which provides an adequate framework for the determinization of timed systems. In this formalism, determinization w.r.t. timed language is always possible at the cost of changing the timed domain. We give a condition for determinizability of automata over a timed domain without changing the timed domain, which allows us to recover...

Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. In this paper, we present a method to map probabilistic operators to an equivalent set of probabilistic operators in a novel normal form, requiring polynomial time and space. From this, we directly derive a determinizati...

To determinize Büchi automata it is necessary to switch to another class of ω-automata, e.g. Muller or Rabin automata. The reason is that there exist languages which are accepted by some nondeterministic Büchi-automaton, but not by any deterministic Büchi-automaton (c.f. section 3.1). The history of constructions for determinizing Büchi automata is long: it starts in 1963 with a faulty construc...

This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. The first development of coalgebraic trace semantics used final coalgebras in Kleisli categories, stemming from an initial algebra in the underlying category. This approach requires some non-trivial assumptions, like dcpo enrichment, which do not always hold, even in cases where one can reasonably speak o...

In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable example...