528 search results - page 18 / 106 » Transition Logic Revisited |
99
Voted
LPNMR
1990
Springer
15 years 5 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
112
Voted
ESORICS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...
128
click to vote
RITA
2000
15 years 1 months ago
2000
This paper discusses how RETOOL, an action logic featuring an operator that expresses necessary conditions, postconditions and time bounds of actions, can be combined with MTL, a ...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
106
Voted
EVOW
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...