DeepAI AI Chat
Log In Sign Up

A Calculus for Modeling Floating Authorizations

by   Jovanka Pantovic, et al.

Controlling resource usage in distributed systems is a challenging task given the dynamics involved in access granting. Consider, for instance, the setting of floating licenses where access can be granted if the request originates in a licensed domain and the number of active users is within the license limits, and where licenses can be interchanged. Access granting in such scenarios is given in terms of floating authorizations, addressed in this paper as first class entities of a process calculus model, encompassing the notions of domain, accounting and delegation. We present the operational semantics of the model in two equivalent alternative ways, each informing on the specific nature of authorizations. We also introduce a typing discipline to single out systems that never get stuck due to lacking authorizations, addressing configurations where authorization assignment is not statically prescribed in the system specification.


page 1

page 2

page 3

page 4


The C_π-calculus: a Model for Confidential Name Passing

Sharing confidential information in distributed systems is a necessity i...

Type Assignment for the Computational lambda-Calculus

We study polymorphic type assignment systems for untyped lambda-calculi ...

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...

Can determinism and compositionality coexist in RML?

Runtime verification (RV) consists in dynamically verifying that the eve...

On the Limit Performance of Floating Gossip

In this paper we investigate the limit performance of Floating Gossip, a...

A Note on Process Modelling: Combining Situation Calculus and Petri Nets

The situation calculus logic model is convenient for modelling the actio...