Learn More
We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series with those which are definable by restricted formulas from a weighted logics over traces. We use a translation technique from formulas over words to those over traces, and vice versa. This(More)
We examine a bidirectional Propositional Dynamic Logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC −. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining(More)
BACKGROUND An altered susceptibility of lung fibroblasts to Fas-induced apoptosis has been implicated in the pathogenesis of pulmonary fibrosis; however, the underlying mechanism is not completely understood. Here, we studied the susceptibility of lung fibroblasts, obtained from patients with (f-fibs) and without pulmonary fibrosis (n-fibs), to FasL-(More)
INTRODUCTION The rheumatoid arthritis (RA) synovium is characterised by the presence of an aggressive population of activated synovial fibroblasts (RASFs) that are prominently involved in the destruction of articular cartilage and bone. Accumulating evidence suggests that RASFs are relatively resistant to Fas-ligand (FasL)-induced apoptosis, but the data(More)
Since recognizable tree languages are closed under the rational operations , every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an(More)