We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrained by symbol sharing. At the semantic level, we introduce a general semantics for our systems and then give a categorial characterization of fibring of models. Based on this, we establish the conditions under which ou...

In this note, we extend Schiitzenberger’s evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged. Let G = ( V, E) be a simple undirected graph without loops; V is its set of vertices, and E its se...

Interleaving theories have traditionally failed to integrate a satisfactory treatment of the so-called “finite delay property”. This is generally attributed to the expansion law of such theories, but actually, the problem is rooted in the concept of labelled transition system. We introduce a new type of system, in which, instead of labelled transitions, we have, essentially, sequences of labell...

Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...