Sciweavers

29 search results - page 1 / 6
» Checking Asynchronously Communicating Components Using Symbo...
Sort
View
COOPIS
2004
IEEE
13 years 8 months ago
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
Olivier Maréchal, Pascal Poizat, Jean-Claud...
COOPIS
2003
IEEE
13 years 10 months ago
Analysing Mailboxes of Asynchronous Communicating Components
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
Jean-Claude Royer, Michael Xu
CAV
2003
Springer
154views Hardware» more  CAV 2003»
13 years 10 months ago
Structural Symbolic CTL Model Checking of Asynchronous Systems
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
Gianfranco Ciardo, Radu Siminiceanu
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
13 years 11 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 4 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
Stefan Wöhrle, Wolfgang Thomas