The algebra of timed processes, ATP: theory and application
Information and Computation
A classical mind
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
A formal description of hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Theoretical Computer Science
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Timed and Hybrid Statecharts and Their Textual Representation
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Nordic Journal of Computing
Information and Computation
Hybrid dynamic systems: relating Chi to hybrid automata
Proceedings of the 35th conference on Winter simulation: driving innovation
From "t to µCRL: Combining Performance and Functional Analysis
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
The φ-calculus: a language for distributed control of reconfigurable embedded systems
HSCC'03 Proceedings of the 6th 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
Brief Equivalence of hybrid dynamical models
Automatica (Journal of IFAC)
Hi-index | 0.00 |
The hybrid @g (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. In this paper, we first provide an overview of @g. Then, the @g formalism is related to other formalisms by means of translation schemes: a translation scheme from continuous-time PWA systems to @g, a translation scheme from discrete-time PWA systems to @g, and a translation scheme from hybrid automata to @g. In order to be able to use existing model checkers that use hybrid automata like input languages, we developed and implemented a translation scheme from a subset of @g to hybrid automata. To illustrate this approach, a case study has been performed: a water level monitor has been modeled using @g. Using the implemented translation scheme from @g to hybrid automata, we obtain a hybrid automata model for the water level monitor. From this model, code that can be used as input for the model checker PHAVer is generated.