Sampled Semantics of Timed Automata

Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study o...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 6, Issue 3; no. 3; p. 14:1
Main Authors:	Krcal, Pavel, Abdulla, Parosh Aziz, Yi, Wang
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.09.2010
Subjects:	Applied mathematics computer science - formal languages and automata theory f.1.1, f.4.3 MATEMATIK MATHEMATICS Teoretisk datalogi Theoretical computer science Tillämpad matematik
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!