DeepAI AI Chat
Log In Sign Up

Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)

by   Lukas Holik, et al.

We propose an efficient algorithm for determinising counting automata (CAs), i.e., finite automata extended with bounded counters. The algorithm avoids unfolding counters into control states, unlike the naïve approach, and thus produces much smaller deterministic automata. We also develop a simplified and faster version of the general algorithm for the sub-class of so-called monadic CAs (MCAs), i.e., CAs with counting loops on character classes, which are common in practice. Our main motivation is (besides applications in verification and decision procedures of logics) the application of deterministic (M)CAs in pattern matching regular expressions with counting, which are very common in e.g. network traffic processing and log analysis. We have evaluated our algorithm against practical benchmarks from these application domains and concluded that compared to the naïve approach, our algorithm is much less prone to explode, produces automata that can be several orders of magnitude smaller, and is overall faster.


page 1

page 2

page 3

page 4


Register Set Automata (Technical Report)

We present register set automata (RsAs), a register automaton model over...

Simulation Algorithms for Symbolic Automata (Technical Report)

We investigate means of efficient computation of the simulation relation...

Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)

Complementation of nondeterministic Büchi automata (BAs) is an important...

Complementing Büchi Automata with Ranker (Technical Report)

We present the tool Ranker for complementing Büchi automata (BAs). Ranke...

Efficient Induction of Finite State Automata

This paper introduces a new algorithm for the induction if complex finit...

The Combinatorics of Barrier Synchronization

In this paper we study the notion of synchronization from the point of v...