Translation of Timed Promela to Timed Automata with Discrete Data

Authors:
Wojciech Nabiałek;Agata Janowska;Paweł Janowski
Affiliations:
(Correspd.) Institute of Computer Science, University of Podlasie, ul. Sienkiewicza 51, 08-110 Siedlce, Poland. wojtek@iis.ap.siedlce.pl;Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. {janowska, janowski}@mimuw.edu.pl;Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. {janowska, janowski}@mimuw.edu.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 8
Cited 0

The tool KRONOS

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Extending Promela and Spin for Real Time

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Discrete-Time Promela and Spin

FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
√erics: a tool for verifying timed automata and estelle specifications

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Slicing of Timed Automata with Discrete Data

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.