5084 search results - page 174 / 1017 » Proving Possibility Properties |
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
151
click to vote
MFCS
2007
Springer
16 years 15 days ago
2007
Springer
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
147
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
142
click to vote
CSL
1994
Springer
15 years 10 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
136
click to vote
PST
2008
15 years 7 months ago
2008
To enable a rich attribute-based authorization system, it is desirable that a large number of user attributes are available, possibly provided by multiple entities. The user may b...