Reachability Analysis of a Switched Buffer Network

  • Goran Frehse
  • Oded Maler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4416)


Many situation in various application domains can be formalized as switched buffer networks, that is, networks of containers in which quantities of some substances are stored and transported at various rates to other buffers. A mode of such a system is defined by the channels that are active at a given time, which determine the rates of change in the quantities of the substances in all the buffers. Switching occurs while opening or closing channels, starting or stopping a reaction, thus causing the system to move from one mode to another. Hybrid automata provide a natural modeling formalism for such systems, a model on which one can verify properties (lack of overflow or deadlock, arrival of products to certain buffers at pre-specified times and quantities) and even automatically synthesize switching controllers that achieve such goals in an efficient manner. Such verification and synthesis techniques can complement traditional analytic techniques that are harder to apply as the switching aspects become more dominant. Looking from the other side of the spectrum, reachability-based methods can be seen adding more rigor and coverage to simulation-based methodologies.


Hybrid Automaton Reachability Analysis Error Trace Outgoing Channel Continuous State Variable 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, Springer, Heidelberg (2002)Google Scholar
  2. 2.
    Tittus, M.: Control Synthesis for Batch Processes. PhD thesis, Chalmers University of Technology (1995)Google Scholar
  3. 3.
    Kowalewski, S., et al.: Verification of logic controllers for continuous plants using timed condition/event-system models. Automatica, Special Issue on Hybrid Systems 35(3), 505–518 (1999), CrossRefMathSciNetGoogle Scholar
  4. 4.
    David, R., Alla, H.: Discrete, Continuous and Hybrid Petri Nets. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  5. 5.
    Horn, C., Ramadge, P.J.: Dynamics of switched arrival systems with thresholds. In: IEEE Conf. Decision and Control, vol. 1, pp. 288–293. IEEE Computer Society Press, Los Alamitos (1993)Google Scholar
  6. 6.
    Kumar, P.R., Meyn, S.P.: Stability of queueing networks and scheduling policies. IEEE Transactions on Automatic Control 40(2), 251–260 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bauer, N., et al.: A case study: Multi product batch plant for the demonstration of control and scheduling problems. In: Engell, S., Kowalewski, S., Zaytoon, J. (eds.) ADPM 2000, pp. 383–388. Shaker, Aachen (2000)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Goran Frehse
    • 1
  • Oded Maler
    • 1
  1. 1.Verimag 

Personalised recommendations