Eventizing Traditionally Opaque Binary Neural Networks as 1-safe Petri net Models
Not on the map. Why?
Abstract (arXiv)
Binary Neural Networks (BNNs) offer a low-complexity and energy-efficient alternative to traditional full-precision neural networks by constraining their weights and activations to binary values. However, their discrete, highly non-linear behavior makes them difficult to explain, validate and formally verify. As a result, BNNs remain largely opaque, limiting their suitability in safety-critical domains, where causal transparency and behavioral guarantees are essential. In this work, we introduce a Petri net (PN)-based framework that captures the BNN's internal operations as event-driven processes. By "eventizing" their operations, we expose their causal relationships and dependencies for a fine-grained analysis of concurrency, ordering, and state evolution. Here, we construct modular PN blueprints for core BNN components including activation, gradient computation and weight updates, and compose them into a complete system-level model. We then validate the composed PN against a reference software-based BNN, verify it against reachability and structural checks to establish 1-safeness, deadlock-freeness, mutual exclusion and correct-by-construction causal sequencing, before we assess its scalability and complexity at segment, component, and system levels using the automated measurement tools in Workcraft. Overall, this framework enables causal introspection of transparent and event-driven BNNs that are amenable to formal reasoning and verification.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 34 references that are in the map. First posted on arXiv 13 Feb 2026.
Builds on
16 of 34 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 752
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 426
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 231
- 2016FINN: A Framework for Fast, Scalable Binarized Neural Network Inferencecited by 150
- 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 72
- 2021BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networkscited by 17
4 more
- 2022Seeking Interpretability and Explainability in Binary Activated Neural Networkscited by 3
- 2023Arrhythmia Classifier Based on Ultra-Lightweight Binary Neural Networkcited by 3
- 2019Minimizing Classification Energy of Binarized Neural Network Inference for Wearable Devicescited by 2
- 2022Lower Bound Proof for the Size of BDDs representing a Shifted Additioncited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Efficient Certified Reasoning for Binarized Neural Networks
- 2022A Mixed Integer Programming Approach for Verifying Properties of Binarized Neural Networks
- 2025Bridging Efficiency and Safety: Formal Verification of Neural Networks with Early Exits
- 2021"BNN - BN = ?": Training Binary Neural Networks without Batch Normalization
- 2026Bringing BNNs to Fast Event Processing
- 2022Deep Binary Reinforcement Learning for Scalable Verification
- 2025On Integer Programming for the Binarized Neural Network Verification Problem
- 2021Bit Error Tolerance Metrics for Binarized Neural Networks