Masaki Waga
Étienne André
ABSTRACT
Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty of only observing sampled discrete-time signals, while real behaviors are continuous-time signals. To mitigate this problem of sampling uncertainties, we introduce a model-bounded monitoring scheme, where we use prior knowledge about the target system to prune interpolation candidates. Technically, we express such prior knowledge by linear hybrid automata (LHAs)---the LHAs are called bounding models. We introduce a novel notion of monitored language of LHAs, and we reduce the monitoring problem to the membership problem of the monitored language. We present two partial algorithms---one is via reduction to reachability in LHAs and the other is a direct one using polyhedra---and show that these methods, and thus the proposed model-bounded monitoring scheme, are efficient and practically relevant.
- Rajeev Alur, Robert P. Kurshan, and Mahesh Viswanathan. 1998. Membership Questions for Timed and Hybrid Automata. In RTSS. IEEE Computer Society, 254--263.Google Scholar
- Étienne André, Ichiro Hasuo, and Masaki Waga. 2018. Offline timed pattern matching under uncertainty. In ICECCS. IEEE Computer Society, 10--20.Google Scholar
- Reza Babaee, Arie Gurfinkel, and Sebastian Fischmeister. 2018. Prevent: A Predictive Run-Time Verification Framework Using Statistical Learning. In SEFM (LNCS, Vol. 10886). Springer, 205--220.Google Scholar
- Roberto Bagnara, Patricia M. Hill, and Enea Zaffanella. 2008. The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems. Science of Computer Programming 72, 1-2 (2008), 3--21.Google ScholarDigital Library
- Alexey Bakhirkin, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. 2018. Online Timed Pattern Matching Using Automata. In FORMATS (LNCS, Vol. 11022). Springer, 215--232.Google ScholarCross Ref
- Anna Becchi and Enea Zaffanella. 2019. Revisiting Polyhedral Analysis for Hybrid Systems. In SAS (LNCS, Vol. 11822). Springer, 183--202.Google ScholarDigital Library
- Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, and James Worrell. 2011. On Reachability for Hybrid Automata over Bounded Time. In ICALP Part II (LNCS, Vol. 6756). Springer, 416--427.Google ScholarCross Ref
- Lei Bu, Rajarshi Ray, and Stefan Schupp. 2019. ARCH-COMP19 Category Report: Bounded Model Checking of Hybrid Systems with Piecewise Constant Dynamics. In ARCH@CPSIoTWeek (EPiC Series in Computing, Vol. 61). EasyChair, 120--128.Google Scholar
- Lei Bu, Jiawan Wang, Yuming Wu, and Xuandong Li. 2019. From Bounded Reachability Analysis of Linear Hybrid Automata to Verification of Industrial CPS and IoT. In SETSS (LNCS, Vol. 12154). Springer, 10--43.Google Scholar
- Xin Chen, Erika Ábrahám, and Goran Frehse. 2011. Efficient Bounded Reachability Computation for Rectangular Automata. In RP (LNCS, Vol. 6945). Springer, 139--152.Google ScholarCross Ref
- Thao Dang and Tarik Nahhal. 2009. Coverage-guided test generation for continuous and hybrid systems. FMSD 34, 2 (2009), 183--213.Google Scholar
- Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. 2005. Automatic Rectangular Refinement of Affine Hybrid Systems. In FORMATS (LNCS, Vol. 3829). Springer, 144--161.Google ScholarDigital Library
- Georgios E. Fainekos and George J. Pappas. 2009. Robustness of temporal logic specifications for continuous-time signals. TCS 410, 42 (2009), 4262--4291.Google ScholarDigital Library
- Ansgar Fehnker and Franjo Ivancic. 2004. Benchmarks for Hybrid Systems Verification. In HSCC (LNCS, Vol. 2993). Springer, 326--341.Google ScholarCross Ref
- Goran Frehse. 2008. PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech. STTT 10, 3 (2008), 263--279.Google ScholarCross Ref
- Goran Frehse, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, Alberto Griggio, Sergio Mover, Muhammad Syifa'ul Mufid, Idriss Riouak, Stefano Tonetta, and Enea Zaffanella. 2019. ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics. In ARCH@CPSIoTWeek (EPiC Series in Computing, Vol. 61). EasyChair, 1--13.Google Scholar
- Jayavardhana Gubbi, Rajkumar Buyya, Slaven Marusic, and Marimuthu Palaniswami. 2013. Internet of Things (IoT): A vision, architectural elements, and future directions. Future Gener. Comput. Syst. 29, 7 (2013), 1645--1660.Google ScholarDigital Library
- Nicolas Halbwachs, Yann-Éric Proy, and Pascal Raymond. 1994. Verification of Linear Hybrid Systems by Means of Convex Approximations. In SAS (LNCS, Vol. 864). Springer, 223--237.Google ScholarCross Ref
- Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. 1992. Timed Transition Systems. In REX (LNCS, Vol. 600). Springer, 226--251.Google ScholarCross Ref
- Oded Maler and Dejan Nickovic. 2004. Monitoring Temporal Properties of Continuous Signals. In FORMATS and FTRTFT (LNCS, Vol. 3253). Springer, 152--166.Google ScholarCross Ref
- Srinivas Pinisetty, Thierry Jéron, Stavros Tripakis, Yliès Falcone, Hervé Marchand, and Viorel Preoteasa. 2017. Predictive runtime verification of timed properties. Journal of Systems and Software 132 (2017), 353--365.Google ScholarDigital Library
- Xin Qin and Jyotirmoy V. Deshmukh. 2020. Clairvoyant Monitoring for Signal Temporal Logic. In FORMATS (LNCS, Vol. 12288). Springer, 178--195.Google Scholar
- Jean-François Raskin. 2005. An Introduction to Hybrid Automata. In Handbook of Networked and Embedded Control Systems. Birkhäuser, 491--518.Google Scholar
- Dogan Ulus, Thomas Ferrère, Eugene Asarin, and Oded Maler. 2014. Timed Pattern Matching. In FORMATS (LNCS, Vol. 8711). Springer, 222--236.Google ScholarCross Ref
- Masaki Waga. 2019. Online Quantitative Timed Pattern Matching with Semiring-Valued Weighted Automata. In FORMATS (LNCS, Vol. 11750). Springer, 3--22.Google ScholarDigital Library
- Xian Zhang, Martin Leucker, and Wei Dong. 2012. Runtime Verification with Predictive Semantics. In NFM (LNCS, Vol. 7226). Springer, 418--432.Google ScholarDigital Library
Index Terms
- Model-bounded monitoring of hybrid systems
Recommendations
Model-bounded Monitoring of Hybrid Systems
Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty of only observing sampled discrete-time signals, while real behaviors are continuous-time signals. To ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
What's decidable about recursive hybrid automata?
HSCC '15: Proceedings of the 18th International Conference on Hybrid Systems: Computation and ControlRecursive hybrid automata generalize recursive state machines in a similar way as hybrid automata generalize state machines. Recursive hybrid automata can be considered as collection of classical hybrid automata with special states that correspond to ...
Comments