NDLI: A quantifier-free SMT encoding of non-linear hybrid automata

Content Provider	IEEE Xplore Digital Library
Author	Cimatti, A. Mover, S. Tonetta, S.
Copyright Year	2012
Description	Author affiliation: Fondazione Bruno Kessler (Cimatti, A.; Mover, S.; Tonetta, S.)
Abstract	Hybrid systems are a clean modeling framework for embedded systems, which feature integrated discrete and continuous dynamics. A well-known source of complexity comes from the time invariants, which represent an implicit quantification of a constraint over all time points of a continuous transition. Emerging techniques based on Satisfiability Modulo Theory (SMT) have been found promising for the verification and validation of hybrid systems because they combine discrete reasoning with solvers for first-order theories. However, these techniques are efficient for quantifier-free theories and the current approaches have so far either ignored time invariants or have been limited to linear hybrid $automata^{1}.$ In this paper, we propose a new method that encodes a class of hybrid systems into transition systems with quantifier-free formulas. The method does not rely on expensive quantifier elimination procedures. Rather, it exploits the sequential nature of the transition system to split the continuous evolution enforcing the invariants on the discrete time points. This pushes the application of SMT-based techniques beyond the standard linear case.
Starting Page	187
Ending Page	195
File Size	186625
Page Count	9
File Format	PDF
ISBN	9781467348324
e-ISBN	9780983567820
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-10-22
Publisher Place	United Kingdom
Access Restriction	Subscribed
Rights Holder	FMCAD Inc
Subject Keyword	Design automation Embedded systems Automata Encoding Polynomials Electronic mail Standards
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Rectangular refinement of affine hybrid systems based on qualitative reasoning

Bidirectional refinement of affine hybrid systems based on qualitative reasoning

An algebraic geometric approach to the identification of a class of linear hybrid systems

Application of SMT solvers to hybrid system verification

The non-blocking forbidden state problem for compact rectangular hybrid automata

A Branch and Bound Algorithm for Generalized Polynomial Programming Problems

Bounded Model Checking of Incomplete Networks of Timed Automata

Exploiting functional dependencies in finite state machine verification

Improvement of optimal algorithm for hybrid system based on MLD model

A quantifier-free SMT encoding of non-linear hybrid automata

Similar Documents

Rectangular refinement of affine hybrid systems based on qualitative reasoning

Bidirectional refinement of affine hybrid systems based on qualitative reasoning

An algebraic geometric approach to the identification of a class of linear hybrid systems

Application of SMT solvers to hybrid system verification

The non-blocking forbidden state problem for compact rectangular hybrid automata

A Branch and Bound Algorithm for Generalized Polynomial Programming Problems

Bounded Model Checking of Incomplete Networks of Timed Automata

Exploiting functional dependencies in finite state machine verification

Improvement of optimal algorithm for hybrid system based on MLD model

A quantifier-free SMT encoding of non-linear hybrid automata