2011
DOI: 10.1145/2000367.2000368
|View full text |Cite
|
Sign up to set email alerts
|

Toward online hybrid systems model checking of cyber-physical systems' time-bounded short-run behavior

Abstract: Many Cyber-Physical Systems (CPS) are highly nondeterministic. This often makes it impractical to model and predict the complete system behavior. To address this problem, we propose that instead of offline modeling and verification, many CPS systems should be modeled and verified online, and we shall focus on the system's time-bounded behavior in short-run future, which is more describable and predictable. Meanwhile, as the system model is generated/updated online, the verification has to be fast. It is meanin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 47 publications
(22 citation statements)
references
References 8 publications
0
22
0
Order By: Relevance
“…Run-time approaches have been considered to create verified systems [15]. In this work, a time-bounded reachability computation is performed during system operation in order to determine if a controller should be disengaged.…”
Section: Case Study Discussionmentioning
confidence: 99%
“…Run-time approaches have been considered to create verified systems [15]. In this work, a time-bounded reachability computation is performed during system operation in order to determine if a controller should be disengaged.…”
Section: Case Study Discussionmentioning
confidence: 99%
“…Context changes may result in increased communication resulting in higher heat dissipation. Future work may include online formal verification of PHMS models using time bounded short run behavior analysis [4]. An appendix is included in the extended version of the paper, which describes the different PHMS configurations and the implementation of the annex (http://impact.asu.edu/publication/PercomBanerjee.pdf).…”
Section: Discussionmentioning
confidence: 99%
“…A Hybrid Automata HA [4] is syntactically a tuple (x,x 0 , V, v 0 , inv, di f, E, act, lab, syn), consisting of the following components:…”
Section: Hybrid Automata As Plant Modelsmentioning
confidence: 99%
“…Recently, there has been extensive research on formal verification of CPS, including [2], [3], [4] and many others. The focus of these approaches has mainly been on correctness of high-level control algorithm designs.…”
mentioning
confidence: 99%