Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …

We study languages over infinite alphabets equipped with some structure that can be tested
by recognizing automata. We develop a framework for studying such alphabets and the …

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of
languages over infinite (structured) alphabets. The abstract approach we take allows us to …

We study Turing machines over sets with atoms, also known as nominal sets. Our main
result is that deterministic machines are weaker than nondeterministic ones; in particular …

In Petri nets with data, every token carries a data value, and executability of a transition is
conditioned by a relation between data values involved. Decidability status of various …

Petri nets with name creation and management (ν ν-PNs) have been recently introduced as
an expressive model for dynamic (distributed) systems, whose dynamics are determined not …

In recent years, a plethora of foundational results and corresponding techniques and tools
has been developed to support the modeling, analysis, execution and improvement of …

We describe a general framework for static verification of systems that base their decisions
upon queries to databases. The database is specified using constraints, typically a schema …

Nominal Monoids | Theory of Computing Systems Skip to main content Springer Nature Link
Account Menu Find a journal Publish with us Track your research Search Cart 1.Home 2.Theory …

Finitely supported structures have historical roots in the permutation models of Zermelo-
Fraenkel set theory with atoms elaborated by Fraenkel and Mostowski in the 1930s in order …