LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Not necessarily closed convex polyhedra and the double description method
Formal Aspects of Computing
A conservative extension of synchronous data-flow with state machines
Proceedings of the 5th ACM international conference on Embedded software
SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Translating discrete-time simulink to lustre
ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Formal Methods in System Design
Symbolic analysis for improving simulation coverage of Simulink/Stateflow models
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Semantic Translation of Simulink/Stateflow Models to Hybrid Automata Using Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining control and data abstraction in the verification of hybrid systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Divide and recycle: types and compilation for a hybrid synchronous language
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
A step towards verification and synthesis from simulink/stateflow models
Proceedings of the 14th international conference on Hybrid systems: computation and control
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Discretizing affine hybrid automata with uncertainty
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Hyperstream processing systems: nonstandard modeling of continuous-time signals
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Hybrid systems are used to model embedded computing systems interacting with their physical environment. There is a conceptual mismatch between high-level hybrid system languages like Simulink, which are used for simulation, and hybrid automata, the most suitable representation for safety verification. Indeed, in simulation languages the interaction between discrete and continuous execution steps is specified using the concept of zero-crossings, whereas hybrid automata exploit the notion of staying conditions. We describe a translation from a hybrid data-flow language to logico-numerical hybrid automata that points out this issue carefully. We expose various zero-crossing semantics, propose a sound translation, and discuss to which extent the original semantics is preserved.