Anthony McIsaac

Learn More
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning(More)
Polarization sensitivity (PS) was examined in two classes of neurons, sustaining fibers and dimming fibers, in the medulla externa (second optic neuropile) of the crayfish, Pacifasticus leniusculus. Visual responses were recorded intracellularly and extracellularly. The influence of e-vector orientation (theta) was probed in steady-state responses, with(More)
Modern hardware designs are typically based on multiple clocks. While a singly-clocked hardware design is easily described in standard temporal logics, describing a multiply-clocked design is cumbersome. Thus it is desirable to have an easier way to formulate properties related to clocks in a temporal logic. We present a relatively simple solution built on(More)
The stimulation of high molecular weight sialoglycoprotein synthesis by a soluble factor derived from normal colon tissues was studied in vitro with human colon carcinoma cell lines, HT-29 P and a metastatic variant HT-29 LMM. The synthesis of all three high-molecular-weight sialoglycoproteins (approximate Mr 900,000, 740,000, and 450,000) by HT-29 P cells(More)
1 Syntax Boolean expression syntax varies according to the Sugar flavor used. The formal syntax definition uses the complete set {¬, ∧}, and semantics are given here only to these two operators. Semantics of any other boolean expression follow directly from these. Definition 1 (Boolean expression). – Every atomic proposition is a boolean expression. – If b,(More)