A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...