1453 search results - page 66 / 291 » State and history in operating systems |
119
click to vote
FCT
1999
Springer
15 years 4 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
85
Voted
SIGMOD
2003
ACM
16 years 20 days ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
99
Voted
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
AAI
2010
14 years 7 months ago
2010
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...