Statecharts: A visual formalism for complex systems
Science of Computer Programming
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proof, language, and interaction
An algebraic framework for urgency
Information and Computation
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
What Will Be Eventually True of Polynomial Hybrid Automata?
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
On the Composition of Hybrid Systems
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
The Symbolic Approach to Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Verification of Reactive Systems: Formal Methods and Algorithms
Verification of Reactive Systems: Formal Methods and Algorithms
Languages and tools for hybrid systems design
Foundations and Trends in Electronic Design Automation
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated symbolic reachability analysis: with application to delta-notch signaling automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Interchange format for hybrid systems: abstract semantics
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Automatic verification of hybrid systems with large discrete state space
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verification of Analog/Mixed-Signal Circuits Using Symbolic Methods
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Towards a modeling language for cyber-physical systems
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
In this paper, we present an extension of the synchronous language Quartz by new kinds of variables, actions and statements for modeling the interaction of synchronous systems with their continuous environment. We present an operational semantics of the obtained hybrid modeling language and moreover show how compilation algorithms that have been originally developed for synchronous languages can be extended to these hybrid programs. Thus, we can automatically translate the hybrid programs to compact symbolic representations of hybrid transition systems that can be immediately used for simulation and formal verification.