NDLI: A new abstraction-refinement based verifier for modular linear hybrid automata and its implementation

Content Provider	IEEE Xplore Digital Library
Author	Hao Ren Jing Huang Shengbing Jiang Kumar, R.
Copyright Year	2014
Description	Author affiliation: Vehicle Health Manage. Group, Gen. Motors, Warren, MI, USA (Shengbing Jiang) \|\| Technol. Solutions Organ., Freescale Semicond., Austin, TX, USA (Jing Huang) \|\| Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA (Hao Ren; Kumar, R.)
Abstract	A concurrent linear hybrid automaton is composed of a set of linear hybrid automata and is used to model linear hybrid systems. Each component's behavior exhibits both discrete and continuous dynamics. We have developed LhaVrf, a symbolic verifier for the reachability verification of concurrent linear hybrid automata. The implementation is based on the algorithm proposed in S. Jiang's papers. In his paper, reachability problem of linear hybrid automata was first reduced to one for linear transition systems, whose reachability analysis was then performed by using counterexample fragment based specification relaxation. S. Jiang proposed in another paper further enhancement in efficiency in context of concurrent systems, where for each counterexample fragment, a minimal conflicting constraints set was identified (that makes the fragment invalid), and used for specification relaxation. We adopted the above key ideas in the implementation of LhaVrf, with added features such as it automatically composes the concurrent subsystem models. Whenever the reachability to an unsafe state is satisfied, the output provides a concrete counterexample with values assigned to the variables. The LhaVrf is illustrated via an application to the Fischer mutual exclusion protocol.
Starting Page	30
Ending Page	35
File Size	946609
Page Count	6
File Format	PDF
ISBN	9781479931064
DOI	10.1109/ICNSC.2014.6819595
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-04-07
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Concrete
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

Language-Based Abstraction Refinement for Hybrid System Verification ⋆

Language-Based Abstraction Refinement for Hybrid System Verification (2007)

Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems

Compositional Abstraction Refinement for Timed Systems

Automata-Based Abstraction Refinement for µHORS Model Checking

Reachability Analysis Of Linear Hybrid Automata By Using Counterexample Fragment Based Abstraction Refinement

A counterexample-guided approach to parameter synthesis for linear hybrid automata (2008)

Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction

Automata-Based Abstraction Refinement for µHORS Model Checking

A new abstraction-refinement based verifier for modular linear hybrid automata and its implementation

Similar Documents

Language-Based Abstraction Refinement for Hybrid System Verification ⋆

Language-Based Abstraction Refinement for Hybrid System Verification (2007)

Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems

Compositional Abstraction Refinement for Timed Systems

Automata-Based Abstraction Refinement for µHORS Model Checking

Reachability Analysis Of Linear Hybrid Automata By Using Counterexample Fragment Based Abstraction Refinement

A counterexample-guided approach to parameter synthesis for linear hybrid automata (2008)

Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction

Automata-Based Abstraction Refinement for µHORS Model Checking

A new abstraction-refinement based verifier for modular linear hybrid automata and its implementation