Nominal Automata for Resource Usage Control

DOI10.1007/978-3-642-31606-7_11zbMath1297.68121OpenAlexW14027142MaRDI QIDQ2914700

Gianluca Mezzetti, Pierpaolo Degano, Gian-Luigi Ferrari

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Nominal Automata for Resource Usage Control ⋮ Parametrized automata simulation and application to service composition ⋮ Regular and context-free nominal traces

Cites Work

• A new approach to abstract syntax with variable binding
• Finite-memory automata
• Context-free languages over infinite alphabets
• A logical characterization of data languages.
• Nominal Automata for Resource Usage Control
• An Automaton over Data Words That Captures EMSO Logic
• Variable Automata over Infinite Alphabets
• Automata vs. Logics on Data Words
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Fresh-register automata
• Types and trace effects of higher order programs
• Types and Effects for Resource Usage Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nominal Automata for Resource Usage Control