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

DOI10.1007/978-3-662-45917-1_7zbMath1444.68115OpenAlexW1012866479MaRDI QIDQ2811927

Publication date: 9 June 2016

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45917-1_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Unnamed Item ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ Coalgebraic semantics for nominal automata

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Symmetries, local names and dynamic (de)-allocation of names
Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
A new approach to abstract syntax with variable binding
About permutation algebras, (pre)sheaves and named sets
A calculus of mobile processes. I
On the learnability of infinitary regular sets
A network-conscious \(\pi\)-calculus and its coalgebraic semantics
A presheaf environment for the explicit fusion calculus
Comparing operational models of name-passing process calculi
Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours
Modelling Infinite Structures with Atoms
Feasible Automata for Two-Variable Logic with Successor on Data Words
On Nominal Regular Languages with Binders
Stream Automata Are Coalgebras
Families of Symmetries as Efficient Models of Resource Binding
LTL with the freeze quantifier and register automata
Safety alternating automata on data words
Two-variable logic on data words
Freshness and Name-Restriction in Sets of Traces with Names
Psi-calculi: a framework for mobile processes with nominal data and logic
An Automaton over Data Words That Captures EMSO Logic
Weak Second‐Order Arithmetic and Finite Automata
Variable Automata over Infinite Alphabets
Decision Problems of Finite Automata Design and Related Arithmetics
Fresh-register automata
A Categorical Model of the Fusion Calculus
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Ultimately periodic words of rational ω-languages

This page was built for publication: A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours