Finite Bisimulations

  • Calin BeltaEmail author
  • Boyan Yordanov
  • Ebru Aydin Gol
Part of the Studies in Systems, Decision and Control book series (SSDC, volume 89)


In this chapter, we focus on verification and control of switched linear systems. We show that a finite bisimulation quotient of a stable switched linear system exists and can be constructed by performing a finite number of basic polyhedral operations. To construct the quotient system, we use a polyhedral Lyapunov function. The existence of such a function is a necessary condition for the stability of a switched linear system. Once a bisimulation quotient is constructed, the verification and synthesis problems can be solved by using techniques presented in Chaps. 4 and 5.


Lyapunov Function Linear Temporal Logic Quotient Transition Switch Linear System Verification Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Mechanical Engineering, Electrical and Computer Engineering, and Systems EngineeringBoston UniversityBostonUSA
  2. 2.Biological Computation GroupMicrosoft Research LtdCambridgeUK
  3. 3.Department of Computer EngineeringMiddle East Technical UniversityCankayaTurkey

Personalised recommendations