384 search results - page 21 / 77 » On the Semantics of Markov Automata |
FASE
2010
Springer
15 years 8 months ago
2010
Springer
f abstraction, providing an effective way to discover a Web service based on its interface. Awards and Scholarships - Ontario Graduate Scholarship (OGS), 2008 - Ontario Graduate S...
149
Voted
PE
2011
Springer
14 years 8 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
124
click to vote
DSN
2007
IEEE
15 years 8 months ago
2007
IEEE
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
105
click to vote
CSL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...
126
Voted
CIVR
2006
Springer
15 years 5 months ago
2006
Springer
Rushes footage are considered as cheap gold mine with the potential for reuse in broadcasting and filmmaking industries. However, it is difficult to mine the "gold" from ...