Sciweavers

2273 search results - page 6 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
FMOODS
2006
13 years 8 months ago
Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams
Nondeterminism in specifications may be used for at least two different purposes. One is to express underspecification, which means that the specifier for the same environment beha...
Atle Refsdal, Ragnhild Kobro Runde, Ketil St&oslas...
ATAL
2005
Springer
14 years 27 days ago
A logic of reasoning, communication and cooperation with syntactic knowledge
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...
Thomas Ågotnes, Michal Walicki
DLT
2009
13 years 5 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
SIGMOD
2010
ACM
164views Database» more  SIGMOD 2010»
13 years 7 months ago
Efficiently evaluating complex boolean expressions
The problem of efficiently evaluating a large collection of complex Boolean expressions
Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmug...
BMCBI
2010
183views more  BMCBI 2010»
13 years 4 months ago
The complexity of gene expression dynamics revealed by permutation entropy
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
Xiaoliang Sun, Yong Zou, Victoria J. Nikiforova, J...