Sciweavers

1699 search results - page 27 / 340
» On the Expressive Power of QLTL
Sort
View
128
Voted
APAL
2004
87views more  APAL 2004»
15 years 16 days ago
Expressive equivalence of least and inflationary fixed-point logic
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
Stephan Kreutzer
129
Voted
LATA
2010
Springer
14 years 11 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
148
Voted
ICC
2009
IEEE
139views Communications» more  ICC 2009»
14 years 10 months ago
Impact of Topology and Shadowing on the Outage Probability of Cellular Networks
This paper proposes an analytical study of the shadowing impact on the outage probability in cellular radio networks. We establish that the downlink other-cell interference factor,...
Jean Marc Kelif, Marceau Coupechoux
KBSE
2010
IEEE
14 years 11 months ago
How did you specify your test suite
Although testing is central to debugging and software certification, there is no adequate language to specify test suites over source code. Such a language should be simple and c...
Andreas Holzer, Christian Schallhart, Michael Taut...
92
Voted
CSL
2007
Springer
15 years 6 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk