A Logic for Concurrent Programming (1994) [13 citations — 1 self]
http://www.cs.utexas.edu/users/psp/maximality.pdf
http://www.cs.utexas.edu/users/psp/unity/new_unity
http://www.cs.utexas.edu/ftp/pub/techreports/tr99-
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Jayadev Misra},
title = {A Logic for Concurrent Programming},
institution = {Formal Aspects of Computing},
year = {1994}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
The UNITY-logic, a fragment of linear temporal logic, was introduced in [5]. In this paper, we describe several recent modifications to this logic. In particular, the operator co replaces unless, for expressing safety properties and, transient predicates form the basis for the progress properties. Our experience suggests that these modifications simplify both the theory and practice of this logic. Overview The UNITY-logic, a fragment of linear temporal logic, was introduced in [5]. Experience gained in applying this logic in practice has led us to modify some of its operators. In particular, we had adopted unless as the primary operator for expressing safety properties, for many years. We suggest a new operator, co, to take its place. Our experience, see, Staskauskas([42],[41],[43]), suggests that the simplicity of formal manipulations is at least as important as the expressive power of an operator. Theoretically, unless and co are equally expressive, while the latter has more ple...
Citations
No citations identified.
