A Succinct Canonical Register Automaton Model

Cassel, Sofia; Howar, Falk; Jönsson, Bengt; Merten, Maik; Steffen, Bernhard

doi:10.1007/978-3-642-24372-1_26

Cited by 27 publications

(15 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RAs were first introduced in [17]. There is an extensive literature on register automata, their formal languages and decidability properties [7,13,21,22,25], including variants with global freshness [20,27] and totally ordered data [4,14]. SRAs are based on the original model of [17], but are much more expressive, due to the presence of guards from an arbitrary decidable theory.…”

Section: Discussionmentioning

confidence: 99%

Symbolic Register Automata

D’Antoni

Ferreira

Sammartino

et al. 2019

Computer Aided Verification

View full text Add to dashboard Cite

Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms for emptiness, inclusion and equivalence checking, together with experimental results.

show abstract

Section: Discussionmentioning

confidence: 99%

Symbolic Register Automata

D’Antoni

Ferreira

Sammartino

et al. 2019

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…An ongoing theme of the work of Bernhard Steffen has been the bringing together of different components in a functional and coordinated manner [55,42,14,12]. This ranges from early work on unifying models [8,55] to bringing together many components [37], to programming environments that combine components and workflows [42,14].…”

Section: Introductionmentioning

confidence: 99%

“…This ranges from early work on unifying models [8,55] to bringing together many components [37], to programming environments that combine components and workflows [42,14]. This theme has as its core finding common languages to express desirable behaviours, and approaches to unify these behaviours and workflows in a single language [8,55,37,42,14,44,12].…”

Section: Introductionmentioning

confidence: 99%

On the Expressiveness of Joining and Splitting

Given-Wilson

Legay

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An ongoing theme of the work of Bernhard Steffen has been the bringing together of different components in a coordinated manner and with a unified language. This paper explores this approach applied to process calculi that account for coordination of different kinds of workflows. Coordination here extends binary interaction to also account for joining of multiple outputs into a single input, and splitting from a single output to multiple inputs. The results here formalise which process calculi can and cannot be encoded into one another, and thus which language has the required expressiveness for given workflow properties. The combination of with other features of interaction allows for the representation of many systems and workflows in an appropriate calculus.

show abstract

“…It is easy to show that the expressive power of register automata with constant symbols is no difference from those versions without constants. A canonical representation theorem similar to Myhill-Nerode theorem for deterministic register automata is developed in [1]. In [2], a learning algorithm for register automata is proposed.…”

Section: Introductionmentioning

confidence: 99%

A Finite Exact Representation of Register Automata Configurations

Chen

Wang

Yen

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations. We describe a technique to classify infinite register automata configurations into finitely many exact representative configurations. Using the finitary representation, we give an algorithm solving the reachability problem for register automata. We moreover define a computation tree logic for register automata and solve its model checking problem.Comment: In Proceedings INFINITY 2013, arXiv:1402.661

show abstract

A Succinct Canonical Register Automaton Model

Cited by 27 publications

References 21 publications

Symbolic Register Automata

Symbolic Register Automata

On the Expressiveness of Joining and Splitting

A Finite Exact Representation of Register Automata Configurations

Contact Info

Product

Resources

About