Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Abstract. This paper proposes a global escape mechanism which can handle unexpected or unwanted conditions changing the default execution of distributed communicational flows, pres...
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
Michael Backes, Matteo Maffei, Esfandiar Mohammadi