You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Model Checking Timed Automata with Priorities using DBM Subtraction

Fulltext:


Authors:

Alexandre David , John Håkansson , Kim Guldstrand Larsen , Paul Pettersson

Publication Type:

Conference/Workshop Paper

Venue:

4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS06)

Publisher:

Springer-Verlag


Abstract

In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result in a non-convex set needing sets of DBMs for representation. Our subtraction algorithms are efficient in the sense that the number of generated DBMs is significantly reduced compared to a naive algorithm. The overhead in time is compensated by the gain from reducing the number of resulting DBMs since this number affects the performance of symbolic model-checking. The uses of the DBM subtraction operation extend beyond timed automata with priorities. It is also useful for allowing guards on transitions with urgent actions, deadlock checking, and timed games.

Bibtex

@inproceedings{David1037,
author = {Alexandre David and John H{\aa}kansson and Kim Guldstrand Larsen and Paul Pettersson},
title = {Model Checking Timed Automata with Priorities using DBM Subtraction},
editor = {Eugene Asarin and Patricia Bouyer},
pages = {128--142},
month = {September},
year = {2006},
booktitle = {4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS06)},
publisher = {Springer-Verlag},
url = {http://www.es.mdh.se/publications/1037-}
}