Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose...
ion from the implementation they use. Some tools rather consequently use this abstract model; others at least partly keep the implementational view, modeling components, e.g., by o...
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...