Sciweavers

1705 search results - page 13 / 341
» Representing Constraints with Automata
Sort
View
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
FUIN
2008
92views more  FUIN 2008»
13 years 7 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
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 transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski
RTSS
1999
IEEE
13 years 12 months ago
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinks...
MTA
2007
83views more  MTA 2007»
13 years 7 months ago
A study on multimedia documents behavior: a notion of equivalence
Abstract. In this paper we address the problem of comparing multimedia documents, which can be described according to different reference models. If we consider presentations as c...
Paola Bertolotti, Ombretta Gaggi
FSEN
2007
Springer
14 years 1 months ago
Zone-Based Universality Analysis for Single-Clock Timed Automata
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
Parosh Aziz Abdulla, Joël Ouaknine, Karin Qua...