384 search results - page 66 / 77 » On the Semantics of Markov Automata |
132
Voted
ASE
2005
15 years 1 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
107
click to vote
TVLSI
2008
15 years 1 months ago
2008
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
143
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
119
click to vote
FAST
2010
15 years 4 months ago
2010
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
132
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined res...