Automatic symbolic verification of embedded systems

Alur, Rajeev; Henzinger, Thomas A.; Ho, Pei-Hsin

doi:10.1109/32.489079

Cited by 416 publications

(241 citation statements)

References 33 publications

Supporting

Mentioning

240

Contrasting

Unclassified

Order By: Relevance

“…Since their introduction (see, e.g., [3]), hybrid automata have initiated a new tradition, promising powerful tools for modeling and reasoning about complex engineered or natural systems: e.g., embedded and real time systems, or computational biology, where the resulting analyses are providing many new insights. Unfortunately, in their flexibility in capturing dynamics, resides also their limitations: many different undecidability and complexity results have been proven over general hybrid automata [4] and cast doubt on their suitability as a general tool that can be algorithmized and efficiently implemented.…”

Section: Motivations and Notationsmentioning

confidence: 99%

Decidable Compositions of O-Minimal Automata

Casagrande

Corvaja

Piazza

et al. 2008

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical modeling in many exemplar systems, both natural and engineered. Unfortunately, parallel composition, which is an atomic operator in such constructions, does not preserve the decidability of reachability. Luckily, this paper is able to show that when one focuses on the composition of semi-algebraic o-minimal automata, it is possible to translate the decidability problem into a satisfiability problem over formulae involving both real and integer variables. While in the general case such formulae would be undecidable, the particular format of the formulae obtained in our translation allows combining decidability results stemming from both algebraic number theory and first-order logic over (R, 0, 1, +, * , <) to yield a novel decidability algorithm. From a more general perspective, this paper exposes many new open questions about decidable combinations of real/integer logics.

show abstract

Section: Motivations and Notationsmentioning

confidence: 99%

Decidable Compositions of O-Minimal Automata

Casagrande

Corvaja

Piazza

et al. 2008

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

“…Often early prototypes are used for requirement validation (Andrews and Goeddel, 1994). Over the years there has been an increasing research effort directed towards the automatic verification of infinite state systems, such as timed automata, hybrid automata, data-independent systems, and relational automata (Alur et al, 1996). Automatic verification of embedded systems includes model-checking procedures checking safety, liveness, time-bounded and duration requirements of digital controllers, schedulers and distributed algorithms (Abdulla and Jonsson, 2003).…”

Section: Verification/validation Of Systemsmentioning

confidence: 99%

An initial categorization of foundational research in complex technical systems

Horváth

2015

J. Zhejiang Univ. Sci. A

View full text Add to dashboard Cite

There has been intense foundational research in complex technical systems (CTSs) over the last half century. These systems are exemplified by advanced mechatronics systems, embedded control systems, real-time systems, agent-based smart systems, distributed software systems, internet of things systems, and cyber-physical systems. The objective of this paper is to offer an initial cataloguing of the various research domains and to identify the major research issues. The paper has an ontological flavour, because it concentrates on what research has been and is being done, rather than on why and how research is done. The underpinning study has been done in three stages: (i) intuition-driven exploration of a reference set of related academic publications, (ii) evidence-based specification of a categorization of the domains and subdomains of research, and (iii) refinement and validation of the proposed classification based on a control set of related academic publications. The proposed reasoning model identifies three categories of research domains. The 'intellectualizations' category includes research domains such as: (i) philosophy, (ii) ontology, and (iii) epistemology of CTSs. The research domains included in the 'realizations' category are: (iv) methodology, and (v) creation of CTSs. The domains considered in the 'influences' category are: (vi) manifestations, and (vii) axiology of CTSs. Based on the proposed reasoning model a landscape of foundational research in CTSs is proposed for public debate. Our follow-up study focuses on the extension of the proposed classification to other families of complex engineered systems such as sociotechnical systems and social ecosystems.

show abstract

“…L inear hybrid automata (LHA) are state-transition systems equipped with continuous variables that can change values with different rates [7]. They are important to computing and society because of their extensive modeling capability.…”

Section: Introductionmentioning

confidence: 99%

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Wang

2005

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme, as well as to save both memory consumptions and manipulation times when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.

show abstract

Automatic symbolic verification of embedded systems

Cited by 416 publications

References 33 publications

Decidable Compositions of O-Minimal Automata

Decidable Compositions of O-Minimal Automata

An initial categorization of foundational research in complex technical systems

Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures

Contact Info

Product

Resources

About