🤖 AI Summary
Existing temporal logics (e.g., LTL, CTL) cannot express hyperproperties—such as non-interference and observational determinism—that require reasoning across multiple execution traces; moreover, no HyperLTL model checker exists for Petri nets. Method: This paper introduces the first automated HyperLTL verification framework for Petri nets, integrated into the TAPAAL platform. It proposes a Petri-net–semantics–aware HyperLTL interpretation and an efficient verification algorithm combining symbolic state-space unfolding, multi-trace synchronized simulation, and SMT solving. The engine reuses TAPAAL’s existing Colored Petri Net (CPN) analysis infrastructure and supports graphical interaction. Contribution/Results: Evaluated on two standard computer-network benchmark suites, our approach scalably detects violations of representative hyperproperties, achieving significantly higher efficiency than state-of-the-art general-purpose HyperLTL tools.
📝 Abstract
Petri nets are a modeling formalism capable of describing complex distributed systems and there exists a large number of both academic and industrial tools that enable automatic verification of model properties. Typical questions include reachability analysis and model checking against logics like LTL and CTL. However, these logics fall short when describing properties like non-interference and observational determinism that require simultaneous reasoning about multiple traces of the model and can thus only be expressed as hyperproperties. We introduce, to the best of our knowledge, the first HyperLTL model checker for Petri nets. The tool is fully integrated into the verification framework TAPAAL and we describe the semantics of the hyperlogic, present the tool's architecture and GUI, and evaluate the performance of the HyperLTL verification engine on two benchmarks of problems originating from the computer networking domain.