The paper introduces a verification-orchestration algorithm and process mining on ARH hypertraces to enable scalable security analysis of automotive network protocols and attribute violations to specific component compromises.
Software Impacts17, 100556 (Sep 2023)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
Low dropout risk CS1 students exhibited three distinct weekly learning strategies while high-risk students showed nine varied patterns, some temporary and recoverable and others signaling imminent dropout.
citing papers explorer
-
Process-Mining of Hypertraces: Enabling Scalable Formal Security Verification of (Automotive) Network Architectures
The paper introduces a verification-orchestration algorithm and process mining on ARH hypertraces to enable scalable security analysis of automotive network protocols and attribute violations to specific component compromises.
-
Hierarchical Decomposition of Separable Workflow-Nets
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
-
Understanding Self-Regulated Learning Behavior Among High and Low Dropout Risk Students During CS1: Combining Trace Logs, Dropout Prediction and Self-Reports
Low dropout risk CS1 students exhibited three distinct weekly learning strategies while high-risk students showed nine varied patterns, some temporary and recoverable and others signaling imminent dropout.