On the Complexity of Bounded Context Switching. - Peter Chini; Jonathan Kolberg; Roland Meyer 001; Prakash Saivasan (CoRR, 2016)

On the Complexity of Bounded Context Switching. - Peter Chini; Jonathan Kolberg; Andreas Krebs; Roland Meyer 001; Prakash Saivasan (ESA, 2017)

Fast Witness Counting. - Peter Chini; Rehab Massoud; Roland Meyer 001; Prakash Saivasan (CoRR, 2018)

Inductive Counting and the Reachability Problem for Petri Nets. - Peter Chini; Roland Meyer 001 (Carl Adam Petri: Ideas, Personality, Impact, 2019)

Temporal Tracing of On-Chip Signals using Timeprints. - Rehab Massoud; Hoang M. Le; Peter Chini; Prakash Saivasan; Roland Meyer 001; Rolf Drechsler (DAC, 2019)

Complexity of Liveness in Parameterized Systems. - Peter Chini; Roland Meyer 001; Prakash Saivasan (FSTTCS, 2019)

A Framework for Consistency Algorithms. - Peter Chini; Prakash Saivasan (FSTTCS, 2020)

Fine-Grained Complexity of Safety Verification. - Peter Chini; Roland Meyer 001; Prakash Saivasan (J. Autom. Reason., 2020)

Petri Net Invariant Synthesis. - Peter Chini; Florian Furbach (NETYS, 2021)

Liveness in broadcast networks. - Peter Chini; Roland Meyer 001; Prakash Saivasan (Computing, 2022)

Fine-Grained Complexity of Program Verification. - Peter Chini (2022)