Translation of Intermediate Language to Timed Automata with Discrete Data

Authors:
Agata Janowska;Paweł Janowski;Dobiesław Wróblewski
Affiliations:
Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland. {janowska, janowski}@mimuw.edu.pl;(Correspd. Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland) Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland. {janowska, janowski}@mimuw. ...;Institute of Computer Science, PAS, Ordona 21, 01-237 Warsaw, Poland. wrobldob@ipipan.waw.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 5
Cited 2

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Checking reachability properties for timed automata via SAT

Fundamenta Informaticae - Concurrency specification and programming
√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

A framework for relating timed transition systems and preserving TCTL model checking

EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Verification of timed-arc Petri nets

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete data and to compare it with the translation to classical timed automata. The paper presents syntax and semantics of both formalisms, the translation rules as well as a simple example.