We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity. We show that usage automata are expressive enough to model policies of real-world applications. We discuss their expressive power, and we prove that the problem of telling whether a computation complies with a usage policy is decidable. The main contribution of this paper is a model checking technique for usage automata. The model is that of usages, i.e. basic processes that describe the possible patterns of resource access and creation. In spite of the model having infinite states, because of recursion and resource creation, we devise a polynomial-time model checking technique for deciding when a usage complies with a usage policy.
|Autori:||Bartoletti, M; Degano, P; Ferrari, G; Zunino, R|
|Titolo:||Model checking usage policies|
|Anno del prodotto:||2014|
|Digital Object Identifier (DOI):||10.1017/S096012951200093X|
|Appare nelle tipologie:||1.1 Articolo in rivista|