39,179 research outputs found
Optimised determinisation and completion of finite tree automata
Determinisation and completion of finite tree automata are important
operations with applications in program analysis and verification. However, the
complexity of the classical procedures for determinisation and completion is
high. They are not practical procedures for manipulating tree automata beyond
very small ones. In this paper we develop an algorithm for determinisation and
completion of finite tree automata, whose worst-case complexity remains
unchanged, but which performs far better than existing algorithms in practice.
The critical aspect of the algorithm is that the transitions of the
determinised (and possibly completed) automaton are generated in a potentially
very compact form called product form, which can reduce the size of the
representation dramatically. Furthermore, the representation can often be used
directly when manipulating the determinised automaton. The paper contains an
experimental evaluation of the algorithm on a large set of tree automata
examples
Observation and Distinction. Representing Information in Infinite Games
We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of an observation process driven by a sequential Mealy machine. In contrast, the second approach features indistinguishability relations described by synchronous two-tape automata.
The indistinguishability-relation model turns out to be strictly more expressive than the one based on observations. We present a characterisation of the indistinguishability relations that admit a representation as a finite-state observation function. We show that the characterisation is decidable, and give a procedure to construct a corresponding Mealy machine whenever one exists
Zone-based verification of timed automata: extrapolations, simulations and what next?
Timed automata have been introduced by Rajeev Alur and David Dill in the
early 90's. In the last decades, timed automata have become the de facto model
for the verification of real-time systems. Algorithms for timed automata are
based on the traversal of their state-space using zones as a symbolic
representation. Since the state-space is infinite, termination relies on finite
abstractions that yield a finite representation of the reachable states.
The first solution to get finite abstractions was based on extrapolations of
zones, and has been implemented in the industry-strength tool Uppaal. A
different approach based on simulations between zones has emerged in the last
ten years, and has been implemented in the fully open source tool TChecker. The
simulation-based approach has led to new efficient algorithms for reachability
and liveness in timed automata, and has also been extended to richer models
like weighted timed automata, and timed automata with diagonal constraints and
updates.
In this article, we survey the extrapolation and simulation techniques, and
discuss some open challenges for the future.Comment: Invited contribution at FORMATS'2
Regularity Preserving but not Reflecting Encodings
Encodings, that is, injective functions from words to words, have been
studied extensively in several settings. In computability theory the notion of
encoding is crucial for defining computability on arbitrary domains, as well as
for comparing the power of models of computation. In language theory much
attention has been devoted to regularity preserving functions.
A natural question arising in these contexts is: Is there a bijective
encoding such that its image function preserves regularity of languages, but
its pre-image function does not? Our main result answers this question in the
affirmative: For every countable class C of languages there exists a bijective
encoding f such that for every language L in C its image f[L] is regular.
Our construction of such encodings has several noteworthy consequences.
Firstly, anomalies arise when models of computation are compared with respect
to a known concept of implementation that is based on encodings which are not
required to be computable: Every countable decision model can be implemented,
in this sense, by finite-state automata, even via bijective encodings. Hence
deterministic finite-state automata would be equally powerful as Turing machine
deciders.
A second consequence concerns the recognizability of sets of natural numbers
via number representations and finite automata. A set of numbers is said to be
recognizable with respect to a representation if an automaton accepts the
language of representations. Our result entails that there is one number
representation with respect to which every recursive set is recognizable
Supervisory Control of Extended Finite Automata Using Transition Projection
A limitation of the Ramadge and Wonham (RW) framework for the supervisory control theory is the explicit state representation using finite automata, often resulting in complex and unintelligible models. Extended finite automata (EFAs), i.e., deterministic finite automata extended with variables, provide compact state representation and then make the control logic transparent through logic expressions of the variables. A challenge with this new control framework is to exploit the rich control structure established in RW's framework. This paper studies the decentralized control structure with EFAs. To reduce the computational complexity, the controller is synthesized based on model abstraction of subsystems, which means that the global model of the entire system is unnecessary. Sufficient conditions are presented to guarantee that the decentralized supervisors result in maximally permissive and nonblocking control to the entire system
- …