NDLI: A Refined Algorithm for Reachability Analysis of Updatable Timed Automata

Content Provider	IEEE Xplore Digital Library
Author	Bingbing Fang Guoqiang Li Ling Fang Jianwen Xiang
Copyright Year	2015
Description	Author affiliation: Wuhan Univ. of Technol., Wuhan, China (Jianwen Xiang) \|\| Hefei Inst. of Phys. Sci., Hefei, China (Ling Fang) \|\| Sch. of Software, Shanghai Jiao Tong Univ., Shanghai, China (Bingbing Fang; Guoqiang Li)
Abstract	Timed automata (TAs) are a widely-used model for formally analyzing real-time systems. Updatable Timed Automata (UTAs), extended from TAs, provide a more flexible way to adjust the value of clock during location switches. The reachability problem of some subclasses of UTAs is decidable. When considering an efficient implementation of these subclasses, the algorithm that is usually used is based on the notion of zones, implemented by Difference Bound Matrices (DBMs). However, similar to that of TAs, the zone-based algorithm is not sound when considering diagonal constraints on clocks, illustrated by a well-known counterexample. This paper proposes a sound zone-based algorithm by introducing extended DBM (EDBM). It refines the standard forward reachability analysis (FRA) algorithm. The correctness of the algorithm is proven and experimental results are given to show the efficiency of the implementation.
Starting Page	230
Ending Page	236
File Size	298372
Page Count	7
File Format	PDF
ISBN	9781467395984
DOI	10.1109/QRS-C.2015.47
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-03
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Conferences Automata Reachability algorithm Software quality Diagonal constrain EDBM Updatable timed automata Reachability analysis Cost accounting Clocks
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

Alternating Timed Automata over Bounded Time

Better Abstractions for Timed Automata

Fortuna: Model Checking Priced Probabilistic Timed Automata

Test generation from timed pushdown automata with inputs and outputs

A New Approach of Partial Order Reduction Technique for Parallel Timed Automata Model Checking

A Full Symbolic Reachability Analysis Algorithm of Timed Automata Based on BDD

Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams

Model Checking Rectangular Hybrid Systems with Timed Computation Tree Logic

Reachability probabilities in Markovian Timed Automata

A Refined Algorithm for Reachability Analysis of Updatable Timed Automata

Similar Documents

Alternating Timed Automata over Bounded Time

Better Abstractions for Timed Automata

Fortuna: Model Checking Priced Probabilistic Timed Automata

Test generation from timed pushdown automata with inputs and outputs

A New Approach of Partial Order Reduction Technique for Parallel Timed Automata Model Checking

A Full Symbolic Reachability Analysis Algorithm of Timed Automata Based on BDD

Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams

Model Checking Rectangular Hybrid Systems with Timed Computation Tree Logic

Reachability probabilities in Markovian Timed Automata

A Refined Algorithm for Reachability Analysis of Updatable Timed Automata