# Nominal Büchi Automata with Name Allocation

@inproceedings{Urbat2021NominalBA, title={Nominal B{\"u}chi Automata with Name Allocation}, author={Henning Urbat and Daniel Hausmann and Stefan Milius and Lutz Schr{\"o}der}, booktitle={CONCUR}, year={2021} }

Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach ω-languages over infinite alphabets in the setting of nominal sets, and study languages of infinite bar strings, i.e. infinite sequences of names that feature binding of fresh names; binding corresponds roughly to reading letters from input words in automata models with registers. We introduce regular nominal nondeterministic Büchi automata… Expand

#### References

SHOWING 1-10 OF 29 REFERENCES

Reachability in Vector Addition Systems is Ackermann-complete

- Computer Science
- ArXiv
- 2021

It is proved that the problem is Fk-hard for Vector Addition Systems with States in dimension 6k, where Fk is the k-th complexity class from the hierarchy of fast-growing complexity classes. Expand

The Reachability Problem for Petri Nets is Not Primitive Recursive

- Computer Science
- ArXiv
- 2021

We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. Moreover in fixed dimension 2d + 4, we show that the problem is… Expand

Equational Axiomatization of Algebras with Structure

- Mathematics, Computer Science
- FoSSaCS
- 2019

The main contributions are a generic HSP theorem and a sound and complete equational logic, which are shown to encompass numerous flavors of equational axiomizations studied in the literature. Expand

The reachability problem for Petri nets is not elementary

- Computer Science, Mathematics
- STOC
- 2019

A non-elementary lower bound is established, i.e. that the reachability problem needs a tower of exponentials of time and space, which implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachable problem, are also not elementary. Expand

Nominal Automata with Name Binding

- Computer Science, Mathematics
- FoSSaCS
- 2017

An automaton model over nominal sets is introduced, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word. Expand

Coalgebraic Trace Semantics for Buechi and Parity Automata

- Computer Science, Mathematics
- CONCUR
- 2016

This paper presents a clean answer to the question that builds on the "maximality" characterization of infinite traces: the accepted language of a Buechi automaton is characterized by two commuting diagrams, one for a least homomorphism and the other for a greatest, much like in a system of (least and greatest) fixed-point equations. Expand

Nominal Game Semantics

- Computer Science
- Found. Trends Program. Lang.
- 2016

These tutorial notes present nominal game semantics, a denotational technique for modelling higher-order programs.

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

- Computer Science
- TGC
- 2014

N nominal automata that accept infinite words are investigated and it is proved decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words are proved. Expand

A Robust Class of Data Languages and an Application to Learning

- Computer Science
- Log. Methods Comput. Sci.
- 2014

This work introduces session automata, an automata model to process data words, i.e., words over an infinite alphabet, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Expand

Automata theory in nominal sets

- Computer Science
- Log. Methods Comput. Sci.
- 2014

A framework for studying languages over infinite alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet is developed. Expand