41 search results - page 6 / 9 » Automata and Logics for Timed Message Sequence Charts |
FUIN
2007
13 years 7 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
SEFM
2008
IEEE
14 years 2 months ago
2008
IEEE
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
IJFCS
2006
13 years 7 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
DATE
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract. We propose an approach to scenario-based analysis and synthesis of real-time embedded systems. The inter-process behaviors of a system are modeled as a set of driving uni...
CODES
2008
IEEE
14 years 2 months ago
2008
IEEE
Software-controlled scratchpad memory is increasingly employed in embedded systems as it offers better timing predictability compared to caches. Previous scratchpad allocation alg...