On simulations and bisimulations of general flow systems

Authors:
J. M. Davoren;Paulo Tabuada
Affiliations:
Department of Electrical & Electronic Engineering, The University of Melbourne, VIC, Australia;Department of Electrical Engineering, The University of California at Los Angeles, CA
Venue:
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Year:
2007

Citing 7
Cited 3

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Communication and Concurrency

Communication and Concurrency
Dynamical Qualitative Analysis of Evolutionary Systems

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Hybrid I/O automata

Information and Computation
Bisimulation relations for dynamical, control, and hybrid systems

Theoretical Computer Science
Bisimilar linear systems

Automatica (Journal of IFAC)

Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions

HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces

HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a notion of bisimulation equivalence between general flow systems, which include discrete, continuous and hybrid systems, and compare it with similar notions in the literature. The interest in the proposed notion is based on our main result, that the temporal logic GFL* - an extension to general flows of the well-known computation tree logic CTL* - is semantically preserved by this equivalence.