Sciweavers

226 search results - page 14 / 46
» A Semantic Unit for Timed Automata Based Modeling Languages
Sort
View
TAL
2010
Springer
13 years 2 months ago
A Formal Ontology for a Computational Approach of Time and Aspect
This paper provides a linguistic semantic analysis of time and aspect in natural languages. On the basis of topological concepts, notions are introduced like the basic aspectual op...
Aurelien Arena, Jean-Pierre Desclés
FORTE
2009
13 years 5 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...
SDL
2001
110views Hardware» more  SDL 2001»
13 years 8 months ago
Timed Extensions for SDL
In this paper we propose some extensions necessary to enable the speci cation and description language SDL to become an appropriate formalism for the design of real-time and embedd...
Marius Bozga, Susanne Graf, Laurent Mounier, Iulia...
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher