Nominal automata for resource usage control

DOI10.1007/978-3-642-31606-7_11MaRDI QIDQ2914700zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Regular and context-free nominal traces
• Learning nominal automata
• Model checking usage policies
• Usage Automata
• A class of automata for the verification of infinite, resource-allocating behaviours

Cites work

• A logical characterization of data languages.
• A new approach to abstract syntax with variable binding
• An automaton over data words that captures EMSO logic
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Automata vs. Logics on Data Words
• Context-free languages over infinite alphabets
• Finite-memory automata
• Fresh-register automata
• scientific article; zbMATH DE number 1759443 (Why is no real title available?)
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• scientific article; zbMATH DE number 1884408 (Why is no real title available?)
• scientific article; zbMATH DE number 1456956 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Nominal automata for resource usage control
• The -calculus: A theory of mobile processes
• Types and Effects for Resource Usage Analysis
• Types and trace effects of higher order programs
• Variable automata over infinite alphabets

Cited in

(10)

• A class of automata for the verification of infinite, resource-allocating behaviours
• Nominal automata for resource usage control
• Resource Driven Automata Nets
• Usage Automata
• Properties and utilization of capacitated automata (invited talk)
• Parametrized automata simulation and application to service composition
• Regular and context-free nominal traces
• Towards nominal context-free model-checking
• Model checking usage policies
• Resource usage verification.

This page was built for publication: Nominal automata for resource usage control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914700)