Sciweavers

592 search results - page 25 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
PAAPP
2006
44views more  PAAPP 2006»
13 years 7 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner
SIES
2007
IEEE
14 years 1 months ago
Protocol Modelling Semantics for Embedded Systems
The properties of a domain oriented modelling approach or language are determined by the dominant semantics of the domain. A significant subclass that needs particular attention,...
Ashley T. McNeile, Ella E. Roubtsova
HYBRID
2005
Springer
14 years 1 months ago
Bisimulation for Communicating Piecewise Deterministic Markov Processes (CPDPs)
Abstract. CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specification of systems from the class of stochastic hybrid processes forme...
Stefan Strubbe, A. J. van der Schaft
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
14 years 23 days ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula