Algorithmic Verification of Continuous and Hybrid Systems

Maler, Oded

doi:10.4204/eptcs.140.4

Cited by 13 publications

(6 citation statements)

References 73 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The increasing ubiquity of software in numerous domains, particularly in safety critical domains, has heightened the need to ensure the correct and reliable operation of deployed software. Over the last several years, there has been a wealth of approaches proposed towards proving the correctness of autonomous systems prior to fielding them in their respective operational design domains [71,94,41,103,26,61]. However, very few approaches exist that can provide strict formal guarantees about their behavior, due to the challenges associated with reasoning about large and complex systems that are tasked with operating in dynamic and uncertain environments.…”

Section: Related Workmentioning

confidence: 99%

An Empirical Analysis of the Use of Real-Time Reachability for the Safety Assurance of Autonomous Vehicles

Musau¹,

Hamilton²,

Lopez³

et al. 2022

Preprint

View full text Add to dashboard Cite

Providing provable assertions of safety at runtime is crucial for autonomous systems.• Autonomous systems are tasked with operating in dynamic and uncertain environments.• Reachability analysis is adept in analyzing the correctness of uncertain systems.• The Simplex Architecture can be used to assure the safety of complex components.• Simplex approaches can be used to assure the safety of machine learning components.

show abstract

Section: Related Workmentioning

confidence: 99%

An Empirical Analysis of the Use of Real-Time Reachability for the Safety Assurance of Autonomous Vehicles

Musau¹,

Hamilton²,

Lopez³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Krishna et al [20] show that using hybrid automata to model and verify cyber-physical systems is, in principle, feasible. Typically, hybrid systems are verified employing reachability analyses and model checking [2,21,22,35]. However, these technqiues are not compositional in general (i.e., modular verification of individual parts to establish correctness of the entire systems is not possible).…”

Section: Related Workmentioning

confidence: 99%

Skill-Based Verification of Cyber-Physical Systems

Knüppel

Jatzkowski

Nolte

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Cyber-physical systems are ubiquitous nowadays. However, as automation increases, modeling and verifying them becomes increasingly difficult due to the inherently complex physical environment. Skill graphs are a means to model complex cyber-physical systems (e.g., vehicle automation systems) by distributing complex behaviors among skills with interfaces between them. We identified that skill graphs have a high potential to be amenable to scalable verification approaches in the early software development process. In this work, we suggest combining skill graphs with hybrid programs. Hybrid programs constitute a program notation for hybrid systems enabling the verification of cyber-physical systems. We provide the first formalization of skill graphs including a notion of compositionality and propose S k e d i t o r, an integrated framework for modeling and verifying them. S k e d i t o r is coupled with the theorem prover K e Y m a e r a X, which is specialized in the verification of hybrid programs. In an experiment exhibiting the follow mode of a vehicle, we evaluate our skill-based methodology with respect to savings in verification effort and potential to find modeling defects at design time. Compared to non-compositional verification, the initial verification effort needed is reduced by more than 53%.

show abstract

“…Systems with polynomial dynamics arise in a number of areas of computer science, including control theory [1], hybrid systems [2], and program analysis [3]. In this paper our focus is on polynomial systems in the context of automata theory.…”

Section: Introductionmentioning

confidence: 99%

Polynomial automata: Zeroness and applications

Benedikt¹,

Duff²,

Sharad³

et al. 2017

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

We introduce a generalisation of weighted automata over a field, called polynomial automata, and we analyse the complexity of the Zeroness Problem in this model, that is, whether a given automaton outputs zero on all words. While this problem is non-primitive recursive in general, we highlight a subclass of polynomial automata for which the Zeroness Problem is primitive recursive. Refining further, we identify a subclass of affine VAS for which coverability is in 2EXPSPACE. We also use polynomial automata to obtain new proofs that equivalence of streaming string transducers is decidable, and that equivalence of copyless streaming string transducers is in PSPACE.

show abstract

Algorithmic Verification of Continuous and Hybrid Systems

Cited by 13 publications

References 73 publications

An Empirical Analysis of the Use of Real-Time Reachability for the Safety Assurance of Autonomous Vehicles

An Empirical Analysis of the Use of Real-Time Reachability for the Safety Assurance of Autonomous Vehicles

Skill-Based Verification of Cyber-Physical Systems

Polynomial automata: Zeroness and applications

Contact Info

Product

Resources

About