Sciweavers

182 search results - page 5 / 37
» Deterministic Behavioural Models for Concurrency
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
COORDINATION
2009
Springer
14 years 8 months ago
Mobility Models and Behavioural Equivalence for Wireless Networks
In protocol development for wireless systems, the choice of appropriate mobility models describing the movement patterns of devices has long been recognised as a crucial factor for...
Jens Chr. Godskesen, Sebastian Nanz
CAAP
1990
13 years 11 months ago
A Markovian Concurrency Measure
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
Dominique Geniet, René Schott, Loÿs Th...
FMOODS
2006
13 years 9 months ago
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
Abstract. Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages shoul...
Pascal Poizat, Jean-Claude Royer, Gwen Salaün
PPL
2006
81views more  PPL 2006»
13 years 7 months ago
Microthreading a Model for Distributed Instruction-level Concurrency
This paper analyses the micro-threaded model of concurrency making comparisons with both data and instruction-level concurrency. The model is fine grain and provides synchronisati...
Chris R. Jesshope