Free Whitepaper

Unabhängigkeit als prüfbare Eigenschaft

Independence is assessed once in a DFA workshop and never revisited. This whitepaper shows how the independence premise in ASIL decompositions can be verified continuously and machine-executed using graph theory.

  • Graph-theoretic verification of independence: complete path evidence instead of workshop judgment
  • Defeater semantics: not just finding coupling paths, but formally justifying their relevance
  • Architecture with 5 LLM agent roles and 1 deterministic Reasoner for continuous assurance
  • Full reference implementation on itemis ANALYZE (ontology, SHACL, SPARQL)
German

Author

Sebastian Ruppel

Sebastian Ruppel

Senior Systems Engineer

What to expect

  1. The independence premise as the weakest link in the safety argument
  2. The verification method: coupling witnesses with complete path evidence
  3. Information model and reference implementation (adapter, ontology, SHACL constraints)
  4. LLM agents in the loop: architecture with 5 roles and 1 deterministic Reasoner
  5. The family of coupling factors (energy, clock, mass, communication, space)
  6. Limitations and outlook
German
Free Download

Get the Whitepaper

Your data will be treated confidentially and will not be shared with third parties.