This paper provides a design rationale for a mechanism that enforces a correct mapping between a model of a nested agent organization and a model of a composite interaction-based ...
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
We elaborate on the verification of properties of electronic institutions, a formalism to define and analyse protocols among agents with a view to achieving global and individual...
Marc Esteva, Wamberto Weber Vasconcelos, Carles Si...
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...