Communication and Concurrency
Handbook of Process Algebra
Discrete Supervisory Control of Hybrid Systems Based on l-Complete Approximations
Discrete Event Dynamic Systems
Verification of Hybrid Systems Using Abstractions
Hybrid Systems II
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Discrete-Time Refinement of Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Hybrid Control Loops, A/D Maps, and Dynamic Specifications
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Information and Computation
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Formal Methods in System Design
Abstractions for hybrid systems
Formal Methods in System Design
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi
Electronic Notes in Theoretical Computer Science (ENTCS)
Differential Dynamic Logic for Hybrid Systems
Journal of Automated Reasoning
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Foundations of a compositional interchange format for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
| Hi-index | 0.00 |
In the context of a hybrid process calculus, we present a formal discretization procedure that abstracts a class of hybrid systems to simply timed systems while preserving observational congruence. The resulting term is not completely discrete because the temporal synchronization between concurrent hybrid processes needs to be maintained. In this paper, we (i) define the hybrid process calculus HCCS as a suitable minimalistic extension of CCS [18], (ii) study its metatheory including an important connection between behavioural congruence and zenoness, (iii) state and prove properties that are required for a rigorous analysis of discretization, and (iv) apply our methodology to prove a hybrid tank system correct.