378 search results - page 43 / 76 » Formalizing Spider Diagrams |
156
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
126
click to vote
SIAMAM
2008
15 years 6 months ago
2008
In this paper we define a class of formal neuron models being computationally efficient and biologically plausible, i.e., able to reproduce a wide range of behaviors observed in in...
175
click to vote
SDL
2007
15 years 7 months ago
2007
Describing an application as a simple composition of services allows advanced features that exploit different platforms to be conceived e formalized at a high abstraction level. S...
181
click to vote
ENTCS
2008
15 years 6 months ago
2008
We do not interact with systems without first performing some physical action on a physical device. This paper shows how formal notations and formal models can be developed to acc...
173
click to vote
ROOM
2000
15 years 7 months ago
2000
In this paper we provide a systematic formal interpretation for most elements of the UML notation. This interpretation, in a structured temporal logic, enables precise analysis of...