Nominal Automata for Resource Usage Control

Degano, Pierpaolo; Ferrari, Gian Luigi; Mezzetti, Gianluca

doi:10.1007/978-3-642-31606-7_11

Cited by 11 publications

(10 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is especially the case if we address resource control issues such as in e.g. [13] (automata-based approach) or [14] (typechecking-based approach). if case: Suppose X♯Y in a given resource graph G. According to Definition 6 there is a path ρ = v 1 → • • • → v n such that X♯ ρ Y with 3 possible causes.…”

Section: Related Workmentioning

confidence: 99%

The Omniscient Garbage Collector: A Resource Analysis Framework

Deharbe¹,

Peschanski²

2014

2014 14th International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

The notion of resource plays a central role in concurrent systems. In its purest form a resource is simply a unique identity one can create, use and ultimately destruct. In this paper we propose a simple yet effective characterization of resource usages and develop for it a complete analysis framework. We address qualitative issues such as the classification of resources and whether two systems exhibit similar patterns of resource usages-namely equivalent resource profiles. From the quantitative point of view, we develop the omniscient garbage collector (OGC), which decides precisely when a resource can be reclaimed or reused. This allows to bound precisely the number of resources consumed by a given system. To illustrate the approach, we study experimentally the resource consumption of pi-calculus processes using a prototype analysis tool. We propose two different resource abstractions for pi-processes: one based on the labelled transitions for open systems, and another one for closed systems. The latter notably provides a refined view of behaviors, less opaque than reductions. Beyond this experiment, the proposed framework is quite generic and can apply to many different formalisms and situations.

show abstract

Section: Related Workmentioning

confidence: 99%

The Omniscient Garbage Collector: A Resource Analysis Framework

Deharbe¹,

Peschanski²

2014

2014 14th International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

show abstract

“…Motivating examples for such models consist, for instance, XML schemas, software with integer parameters, and system specification and verification. Later on, it came up that finite automata over infinite alphabets can contribute also to a series of interesting topics namely, the problem of query graph databases [33], reasoning about systems with resource generation capabilities [10,11], learning theories [30], and systems with freshness needed in object-oriented languages and security protocols [6].…”

Section: Introductionmentioning

confidence: 99%

“…Several models of automata with data values, i.e., over infinite alphabets have been investigated, namely register [24,28,29,37], data [5], pebble [28,36,39], nominal [10], variable [21,22], and P automata [9]. All these models refer to qualitative aspects of infinite state systems.…”

Section: Introductionmentioning

confidence: 99%

“…Our motivation origins from the fact that several applications require a quantitative analysis of systems, for instance the resource usage control where resource variables are mapped to infinite domains [10,11]. It is well-known that weighted automata is a reasonable tool for the description of quantitative features of computing systems [14].…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, in [3], fresh variable automata were equipped with guards consisting of equalities and disequalities. In [10] variable automata were extended to consume data words, in order to express security policies (safety properties) for model checking programs that dynamically generate and operate over resources. Very recently, variable automata have been also used for querying graph databases [43].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Weighted Recognizability over Infinite Alphabets

Pittou¹,

Rahonis²

2017

Acta Cybern

View full text Add to dashboard Cite

We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove that the class of their behaviors is closed under sum, and under scalar, Hadamard, Cauchy, and shuffle products, as well as star operation. Furthermore, we consider rational series over infinite alphabets and we state a Kleene-Schützenberger theorem. We introduce a weighted monadic second order logic and a weighted linear dynamic logic over infinite alphabets and investigate their relation to weighted variable automata. An application of our theory, to series over the Boolean semiring, concludes to new results for the class of languages accepted by variable automata.

show abstract