Detailed Information on Publication Record
2014
Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
BIRCH, Sine V., Thomas S. JACOBSEN, Jacob J. JENSEN, Christoffer MOESGAARD, Niels N. SAMUELSEN et. al.Basic information
Original name
Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
Authors
BIRCH, Sine V. (208 Denmark), Thomas S. JACOBSEN (208 Denmark), Jacob J. JENSEN (208 Denmark), Christoffer MOESGAARD (208 Denmark), Niels N. SAMUELSEN (208 Denmark) and Jiří SRBA (203 Czech Republic, guarantor, belonging to the institution)
Edition
Nizozemsko, Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'14), p. 237-251, 15 pp. 2014
Publisher
Springer-Verlag
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Netherlands
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
printed version "print"
References:
Impact factor
Impact factor: 0.402 in 2005
RIV identification code
RIV/00216224:14330/14:00080035
Organization unit
Faculty of Informatics
ISBN
978-3-319-10511-6
ISSN
Keywords in English
timed-arc Petri nets; approximation; abstractions; verification
Tags
Tags
International impact, Reviewed
Změněno: 10/4/2015 08:46, Prof. Jiří Srba, Ph.D.
Abstract
V originále
State-space explosion is a major obstacle in verification of time-critical distributed systems. An important factor with a negative influence on the tractability of the analysis is the size of constants that clocks are compared to. This problem is particularly accented in explicit state-space exploration techniques. We suggest an approximation method for reducing the size of constants present in the model. The proposed method is developed for Timed-Arc Petri Nets and creates an under-approximation or an over-approximation of the model behaviour. The verification of approximated Petri net models can be considerably faster but it does not in general guarantee conclusive answers. We implement the algorithms within the open-source model checker TAPAAL and demonstrate on a number of experiments that our approximation techniques often result in a significant speed-up of the verification.