We generalise the traditional approach of Smyth and Plotkin to the solution of recursive domain equations from order-enriched structures to bicategorical ones and thereby develop ...
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logi...
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
d Abstract) Jos´e Bacelar Almeida, Jorge Sousa Pinto, and Miguel Vila¸ca 1,2,3 Departamento de Inform´atica Universidade do Minho 4710-057 Braga, Portugal