The first technique for computing the set of transitions T to consider in a selective search actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …
This is, we believe, the final version of a chaper for the Handbook of Logic and the Foundations of Computer Science, vol. IV, Oxford University Press. It surveys a range of …
G Winskel - Linear Time, Branching Time and Partial Order in …, 1989 - Springer
Event structures are models of processes as events constrained by relations of consistency and enabling. These notes are intended to introduce the mathematical theory of event …
The construction of any broadly understood theory of information or infor mation processing system involves two major methodological processes:(1) abstraction and analysis,(2) …
This chapter is motivated by the need for a formal specification method for time-critical systems. The need for such a method is becoming acute since more and more vital …
A temporal logic for causality (T/sub LC/) is introduced. The logic is interpreted over causal structures corresponding to partial order executions of programs. For causal structures …
S Katz, D Peled - Distributed Computing, 1992 - Springer
We present a formal proof method for distributed programs. The semantics used to justify the proof method explicitly identifies equivalence classes of execution sequences which are …
PS Thiagarajan - … Ninth Annual IEEE Symposium on Logic in …, 1994 - ieeexplore.ieee.org
The propositional temporal logic of linear time (PTL) is interpreted over linear orders of order type (/spl omega/,/spl les/). In applications, these linear orders consist of interleaved …
Time is ubiquitous in information systems. Almost every enterprise faces the problem of its data becoming out of date. However, such data is often valu able, so it should be archived …