Bisimilarity in Fresh-Register Automata

Murawski, Andrzej S.; Ramsay, Steven J.; Tzevelekos, Nikos

doi:10.1109/lics.2015.24

Cited by 8 publications

(21 citation statements)

References 30 publications

(47 reference statements)

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%

See 1 more Smart Citation

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%

“…We now introduce a symbolic technique to decide similarity and bisimilarity of SRAs. The basic idea is similar to symbolic (bi)simulation [20,27]…”

Section: Theorem 2 (Emptiness) There Is An Algorithm To Decide Reachmentioning

confidence: 99%

Symbolic Register Automata

D’Antoni

Ferreira

Sammartino

et al. 2019

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…On the theoretical side, there are many complexity results for register automata [4,33]. In particular, we note that problems such as emptiness and equivalence are NP-hard depending on the type of register automaton.…”

Section: Related Workmentioning

confidence: 99%

“…In nominal automata, such configurations will be encoded in different orbits. An interesting open problem is whether equivalence of unique-valued register automata is in Ptime [33].…”

Section: Related Workmentioning

confidence: 99%

Fast Computations on Ordered Nominal Sets

Venhoek¹,

Moerman²,

Rot³

2018

Theoretical Aspects of Computing – ICTAC 2018

View full text Add to dashboard Cite

We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the level of orbits, which allows for an accurate complexity analysis. The approach is implemented as the library Ons (Ordered Nominal Sets).Our main motivation is nominal automata, which are models for recognising languages over infinite alphabets. We evaluate Ons in two applications: minimisation of automata and active automata learning. In both cases, Ons is competitive compared to existing implementations and outperforms them for certain classes of inputs.

show abstract

“…Nowadays, these developments are described as "nominal computation", and there is active research on its applications. Classical research questions, such as computability via Turing machines, are finding their way in this new area of computation theory [1,22], as well as algebraic description of terms with binding over richer algebraic structures than just pure names [20], coalgebraic interpretations of nominal regular expressions [23], alternative, more powerful interpretations of freshness [42,35], theories of languages of infinite words aimed at automata-theoretic model checking [9], and several other developments scattered along many research groups. This is just the surface of a much richer theory.…”

Section: Beyond Pure Namesmentioning

confidence: 99%

From urelements to Computation

Ciancia

2016

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Around 1922-1938, a new permutation model of set theory was defined. The permutation model served as a counterexample in the first proof of independence of the Axiom of Choice from the other axioms of Zermelo-Fraenkel set theory. Almost a century later, a model introduced as part of a proof in abstract mathematics fostered a plethora of research results, ranging from the area of syntax and semantics of programming languages to minimization algorithms and automated verification of systems. Among these results, we find Lawvere-style algebraic syntax with binders, final-coalgebra semantics with resource allocation, and minimization algorithms for mobile systems. These results are also obtained in various different ways, by describing, in terms of category theory, a number of models equivalent to the permutation model. We aim at providing both a brief history of some of these developments, and a mild introduction to the recent research line of "nominal computation theory", where the essential notion of name is declined in several different ways. Research partially funded by the European Commission FP7 ASCENS (nr. 257414), and EU QUANTICOL (nr. 600708).

show abstract

Bisimilarity in Fresh-Register Automata

Cited by 8 publications

References 30 publications

Symbolic Register Automata

Symbolic Register Automata

Fast Computations on Ordered Nominal Sets

From urelements to Computation

Contact Info

Product

Resources

About