We consider the verification of liveness properties for concurrent programs running on weak
memory models. To that end, we identify notions of fairness that preclude demonic non …

We present Probabilistic Total Store Ordering (PTSO)–a probabilistic extension of the
classical TSO semantics. For a given (finitestate) program, the operational semantics of …

We give an overview of recently established results about the effective asymptotic analysis
of termination and counter complexity of VASS computations. In contrast to" classical" …

Petri nets are an established model of concurrency. A Petri net is terminating if for every
initial marking there is a uniform bound on the length of all possible runs. Recent work on …

The termination complexity of a given VASS is a function L assigning to every n the length of
the longest non-terminating computation initiated in a configuration with all counters …

We show that for every fixed $ k\geq 3$, the problem whether the termination/counter
complexity of a given demonic VASS is $\mathcal {O}(n^ k) $, $\Omega (n^{k}) $, and …

The standard approach to analyzing the asymptotic complexity of probabilistic programs is
based on studying the asymptotic growth of certain expected values (such as the expected …

Kurzfassung Die steigende Zahl von Computerprogrammen in unserem Alltag hat zu immer
umfangreicheren Softwaresystemen geführt. Die klassische Herangehensweise, um die …

As computer systems are getting more and more complex, it is not feasible to verify the
correctness of every computer system by hand. Moreover, due to undecidability of the …

Abstract Vector Addition Systems with States (VASS) are a fundamental model for
concurrent processes, parallel programs, and parametrised systems. They can be also used …