Introduction to mathematical systems theory: a behavioral approach
Introduction to mathematical systems theory: a behavioral approach
Process Algebra with Timing
On Hybrid Systems and the Modal µ-calculus
Hybrid Systems V
Dynamical Qualitative Analysis of Evolutionary Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
Bisimulation relations for dynamical, control, and hybrid systems
Theoretical Computer Science
On simulations and bisimulations of general flow systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
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
Switching logic synthesis for reachability
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Reconciling urgency and variable abstraction in a hybrid compositional setting
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Repairing time-determinism in the process algebra for hybrid systems ACPhssrt
Theoretical Computer Science
| Hi-index | 0.00 |
Recently, hybrid-time flow systems have been introduced as an extension to timed transition systems, hybrid automata, continuous time evolutions of differential equations etc. Furthermore, a number of notions of bisimulation have been defined on these flow systems reflecting abstraction from certain timing properties. In this paper, we research the difference in abstraction level between this new semantic model of flow systems, and the more traditional model of real-time transition systems. We explore translations between the old and new semantic models, and we give a necessary and sufficient condition, called finite-set refutability, for these translations to be without loss of information. Finally, we show that differential inclusions with an upper-semicontinuous, closed and convex right-hand side, are finite-set refutable, and easily extend this result to impuls differential inclusions and hybrid automata.