2 papers
cs.LO2020
Efficient Restrictions of Immediate Observation Petri Nets
Michael Raskin, Chana Weil-Kennedy
In a previous paper we introduced immediate observation Petri nets, a subclass of Petri nets with application domains in distributed protocols (population protocols) and theoretica…
cs.LO2019
Working with first-order proofs and provers
Michael Raskin, Christoph Welzel
Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming…