Sciweavers

82 search results - page 13 / 17
» Automatically transforming and relating Uppaal models of emb...
Sort
View
EMSOFT
2006
Springer
14 years 6 days ago
Polychronous mode automata
Among related synchronous programming principles, the model of computation of the Polychrony workbench stands out by its capability to give high-level description of systems where...
Jean-Pierre Talpin, Christian Brunette, Thierry Ga...
SOCO
2007
Springer
14 years 2 months ago
Synthesizing Communication Middleware from Explicit Connectors in Component Based Distributed Architectures
In component based software engineering, an application is build by composing trusted and reusable units of execution, the components. A composition is formed by connecting the com...
Dietmar Schreiner, Karl M. Göschka
CODES
2006
IEEE
14 years 2 months ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...
IANDC
2008
131views more  IANDC 2008»
13 years 8 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
ICECCS
2005
IEEE
125views Hardware» more  ICECCS 2005»
14 years 2 months ago
Model Checking Live Sequence Charts
Live Sequence Charts (LSCs) are a broad extension to Message Sequence Charts (MSCs) to capture complex interobject communication rigorously. A tool support for LSCs, named PlayEng...
Jun Sun 0001, Jin Song Dong