We introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek’s higher-dimensional automata and Alur’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also show how to use tensor products to combat state-space explosion and how to extend the setting to higher-dimensional hybrid automata.

In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata and automata weighted over a field. 1998 ACM Subject Classification F.1.1

We are developing a system for reconstructing polyhedral surfaces from multiple images. This process can take advantage of the topological relations of the observed image features triggering and therefore speeding up the grouping of features to polyhedral surfaces. Exploiting the statistical properties of features when grouping them leads to consistent decisions being invariant to numbering and...

Operational semantics of hybrid systems p. 25 SOS methods for semi-algebraic games and optimization p. 54 The discrete time behavior of lazy linear hybrid automata p. 55 Perturbed timed automata p. 70 A homology theory for hybrid systems : hybrid homology p. 86 Observability of switched linear systems in continuous time p. 103 Controller synthesis on non-uniform and uncertain discrete-time doma...

A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...

Languages correspo nding to two invariant subshifts, the limit set and periodic set are examined. The complement of the language produced by a cellular automaton limit set is always recursively enumerable (r .e.), and modulo intersection with a regular langu age and s-limited homomor phism, all languages wit h r.e. complements arise this way. Th e language produced by the periodic set is always...

In this paper we present a teledrilling system operated by a mode switching control strategy based on hybrid automata. Experiments show stable behavior of teleoperation with constant time-delay. Using hybrid automata we propose a control scheme using control mode switching depending on the discrete state of the the reference generating hybrid automaton. This concept is validated in autonomous d...

Abstract Sequence theories are an extension of strings with infinite alphabet letters, together a corresponding theory (e.g. linear integer arithmetic). Sequences natural abstractions extendable arrays, which permit wealth operations including append, map, split, and concatenation. In spite the growing amount tool support for sequences by leading SMT-solvers, little is known about decidability ...

Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by Ćirić et al. (2012) [7], [8] as relations the sets of states automata. However, they act crisp relationship In particular, if there exists (forward) bisimulation automata, then languages recognized them are crisply equal. Approximate simulations introduced Stanimirović (2022) [36] aim at ...