Translation of Timed Promela to Timed Automata with Discrete Data

被引：0

作者：

Nabialek, Wojciech ^{[1
]}

Janowska, Agata ^{[2
]}

Janowski, Pawel ^{[2
]}

机构：

[1] Univ Podlasie, Inst Comp Sci, PL-08110 Siedlce, Poland

[2] Univ Warsaw, Inst Informat, PL-02097 Warsaw, Poland

来源：

FUNDAMENTA INFORMATICAE | 2008年 / 85卷 / 1-4期

关键词：

Promela; Spin; Timed Automata; timed systems; model checking;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela. a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended with integer variables. The translation enables verification of Promela specifications via tools accepting timed automata as input, such as VerICS or Uppaal. The translation is illustrated with a well known example of Fischer's mutual exclusion protocol. Some experimental results are also presented.

引用

页码：409 / 424

页数：16