Sciweavers

154 search results - page 21 / 31
» Formal Verification of Exact Computations Using Newton's Met...
Sort
View
ISOLA
2010
Springer
14 years 7 months ago
Analysing Message Sequence Graph Specifications
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
15 years 4 months ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
FORMATS
2006
Springer
15 years 1 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
ISCAS
2008
IEEE
119views Hardware» more  ISCAS 2008»
15 years 4 months ago
Adjusting the neurons models in neuromimetic ICs using the voltage-clamp technique
— This paper presents an original method to tune a neuromimetic IC based on neuron conductance-based models (Hodgkin-Huxley formalism). This method is well known in electrophysio...
Sylvain Saïghi, Laure Buhry, Yannick Bornat, ...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan