๐ฎ
๐ฎ
The Ethereal
Hierarchical State Machines as Modular Horn Clauses
July 15, 2016 ยท The Ethereal ยท ๐ HCVS@ETAPS
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Pierre-Loรฏc Garoche, Temesghen Kahsai, Xavier Thirioux
arXiv ID
1607.04457
Category
cs.LO: Logic in CS
Cross-listed
cs.PL,
cs.SE
Citations
11
Venue
HCVS@ETAPS
Last Checked
2 months ago
Abstract
In model based development, embedded systems are modeled using a mix of dataflow formalism, that capture the flow of computation, and hierarchical state machines, that capture the modal behavior of the system. For safety analysis, existing approaches rely on a compilation scheme that transform the original model (dataflow and state machines) into a pure dataflow formalism. Such compilation often result in loss of important structural information that capture the modal behaviour of the system. In previous work we have developed a compilation technique from a dataflow formalism into modular Horn clauses. In this paper, we present a novel technique that faithfully compile hierarchical state machines into modular Horn clauses. Our compilation technique preserves the structural and modal behavior of the system, making the safety analysis of such models more tractable.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal