185 research outputs found
Kickstarting Choreographic Programming
We present an overview of some recent efforts aimed at the development of
Choreographic Programming, a programming paradigm for the production of
concurrent software that is guaranteed to be correct by construction from
global descriptions of communication behaviour
Parameterized verification
The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV \u201914 and PV \u201915, we survey some of the works developed in this research area
A unified view of parameterized verification of abstract models of broadcast communication
We give a unified view of different parameterized models of concurrent and distributed systems with broadcast communication based on transition systems. Based on the resulting formal models, we discuss related verification methods and tools based on abstractions and symbolic state exploration
Monus Semantics in Vector Addition Systems with States
Vector addition systems with states (VASS) are a popular model for concurrent systems. However, many decision problems have prohibitively high complexity. Therefore, it is sometimes useful to consider overapproximating semantics in which these problems can be decided more efficiently.
We study an overapproximation, called monus semantics, that slightly relaxes the semantics of decrements: A key property of a vector addition systems is that in order to decrement a counter, this counter must have a positive value. In contrast, our semantics allows decrements of zero-valued counters: If such a transition is executed, the counter just remains zero.
It turns out that if only a subset of transitions is used with monus semantics (and the others with classical semantics), then reachability is undecidable. However, we show that if monus semantics is used throughout, reachability remains decidable. In particular, we show that reachability for VASS with monus semantics is as hard as that of classical VASS (i.e. Ackermann-hard), while the zero-reachability and coverability are easier (i.e. EXPSPACE-complete and NP-complete, respectively). We provide a comprehensive account of the complexity of the general reachability problem, reachability of zero configurations, and coverability under monus semantics. We study these problems in general VASS, two-dimensional VASS, and one-dimensional VASS, with unary and binary counter updates
Asymmetric distances for approximate differential privacy
Differential privacy is a widely studied notion of privacy for various models of computation, based on measuring differences between probability distributions. We consider (epsilon,delta)-differential privacy in the setting of labelled Markov chains. For a given epsilon, the parameter delta can be captured by a variant of the total variation distance, which we call lv_{alpha} (where alpha = e^{epsilon}). First we study lv_{alpha} directly, showing that it cannot be computed exactly. However, the associated approximation problem turns out to be in PSPACE and #P-hard. Next we introduce a new bisimilarity distance for bounding lv_{alpha} from above, which provides a tighter bound than previously known distances while remaining computable with the same complexity (polynomial time with an NP oracle). We also propose an alternative bound that can be computed in polynomial time. Finally, we illustrate the distances on case studies
Monus semantics in vector addition systems with states
Vector addition systems with states (VASS) are a popular model for concurrent
systems. However, many decision problems have prohibitively high complexity.
Therefore, it is sometimes useful to consider overapproximating semantics in
which these problems can be decided more efficiently.
We study an overapproximation, called monus semantics, that slightly relaxes
the semantics of decrements: A key property of a vector addition systems is
that in order to decrement a counter, this counter must have a positive value.
In contrast, our semantics allows decrements of zero-valued counters: If such a
transition is executed, the counter just remains zero.
It turns out that if only a subset of transitions is used with monus
semantics (and the others with classical semantics), then reachability is
undecidable. However, we show that if monus semantics is used throughout,
reachability remains decidable. In particular, we show that reachability for
VASS with monus semantics is as hard as that of classical VASS (i.e.
Ackermann-hard), while the zero-reachability and coverability are easier (i.e.
EXPSPACE-complete and NP-complete, respectively). We provide a comprehensive
account of the complexity of the general reachability problem, reachability of
zero configurations, and coverability under monus semantics. We study these
problems in general VASS, two-dimensional VASS, and one-dimensional VASS, with
unary and binary counter updates
- …