Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Handbook of theoretical computer science (vol. B)
The hierarchical lattices of a finite machine
Systems & Control Letters
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Model checking LTL over controllable linear systems is decidable
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Compositional Abstractions of Hybrid Control Systems
Discrete Event Dynamic Systems
Bisimulation relations for dynamical, control, and hybrid systems
Theoretical Computer Science
Approximate bisimulation relations for constrained linear systems
Automatica (Journal of IFAC)
Fault Diagnosis of Discretely Controlled Continuous Systems by Means of Discrete-Event Models
Discrete Event Dynamic Systems
Approximate Simulation Relations for Hybrid Systems
Discrete Event Dynamic Systems
Parameter Synthesis for Piecewise Affine Systems from Temporal Logic Specifications
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Composition of Motion Description Languages
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
MTL robust testing and verification for LPV systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Compositional analysis for linear control systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
On simulations and bisimulations of general flow systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Hierarchical synthesis of hybrid controllers from temporal logic specifications
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Model checking LTL over controllable linear systems is decidable
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Coalgebraic foundations of linear systems
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Automatica (Journal of IFAC)
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A fully automated framework for control of linear systems from LTL specifications
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Observability of switched linear systems in continuous time
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Bisimulation for communicating piecewise deterministic markov processes (CPDPs)
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Formal analysis of piecewise affine systems through formula-guided refinement
Automatica (Journal of IFAC)
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Reorientation of linear switched systems using state feedback
Automatica (Journal of IFAC)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 22.15 |
The notion of bisimulation in theoretical computer science is one of the main complexity reduction methods for the analysis and synthesis of labeled transition systems. Bisimulations are special quotients of the state space that preserve many important properties expressible in temporal logics, and, in particular, reachability. In this paper, the framework of bisimilar transition systems is applied to various transition systems that are generated by linear control systems. Given a discrete-time or continuous-time linear system, and a finite observation map, we characterize linear quotient maps that result in quotient transition systems that are bisimilar to the original system. Interestingly, the characterizations for discrete-time systems are more restrictive than for continuous-time systems, due to the existence of an atomic time step. We show that computing the coarsest bisimulation, which results in maximum complexity reduction, corresponds to computing the maximal controlled or reachability invariant subspace inside the kernel of the observations map. These results establish strong connections between complexity reduction concepts in control theory and computer science.