1 citations · 1 across the 2 of their papers we have counts for
7 papers
Petri Net Invariant Synthesis
Peter Chini, Florian Furbach
We study the synthesis of inductive half spaces (IHS). These are linear inequalities that form inductive invariants for Petri nets, capable of disproving reachability or coverabili…
A Framework for Consistency Algorithms
Peter Chini, Prakash Saivasan
We present a framework that provides deterministic consistency algorithms for given memory models. Such an algorithm checks whether the executions of a shared-memory concurrent pro…
Complexity of Liveness in Parameterized Systems
Peter Chini, Roland Meyer, Prakash Saivasan
We investigate the fine-grained complexity of liveness verification for leader contributor systems. These consist of a designated leader thread and an arbitrary number of identical…
Liveness in Broadcast Networks
Peter Chini, Roland Meyer, Prakash Saivasan
We study liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem that we consider is L…
Fast Witness Counting
Peter Chini, Rehab Massoud, Roland Meyer +1
We study the witness-counting problem: given a set of vectors in the -dimensional vector space over , a target vector , and an integer , count all ways t…
Fine-Grained Complexity of Safety Verification
Peter Chini, Roland Meyer, Prakash Saivasan
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memor…
On the Complexity of Bounded Context Switching
Peter Chini, Jonathan Kolberg, Andreas Krebs +2
Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared memory concurrent programs. Technically, BCS is a reachability…