We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke...
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
— Consider a discrete-time networked control scheme, in which the controller has direct access to noisy measurements of the plant’s output, but the controller and the actuator ...
— In this paper, we consider a source rate control scheme for a finite buffer of size C in a medium access control layer of a wireless system over a Markovian channel. Our rate ...