A really temporal logic by Rajeev Alur; T A Henzinger; Stanford University. Computer

By Rajeev Alur; T A Henzinger; Stanford University. Computer Science Department

Show description

Read Online or Download A really temporal logic PDF

Best logic books

Character Evidence: An Abductive Theory (Argumentation Library)

This e-book examines the character of proof for personality judgments, utilizing a version of abductive reasoning referred to as Inference To the easiest rationalization. The ebook expands this concept according to contemporary paintings with types of reasoning utilizing argumentation thought and synthetic intelligence. the purpose is not only to teach how personality judgments are made, yet how they need to be appropriately be made in accordance with sound reasoning, fending off universal error and superficial judgments.

Extra info for A really temporal logic

Sample text

The three-stage, two-way handshaking structure 52 Reactive Modules module SyncSender is private pc : {produce, send }; done P : E interface transmit : E; msg S : M; msg P : M⊥ external ready : E passive atom Stage2 controls pc, transmit, msg S reads pc, done P , ready, transmit, msg P awaits done P , ready init [] true → pc := produce; msg S := M update [] pc = produce ∧ done P ? → pc := send [] pc = send ∧ ready? ; msg S := msg P ; pc := produce lazy atom Producer controls done P , msg P reads pc, done P module Receiver is private pc : {receive, consume}; msg R : M; done C : E interface ready : E; msg C : M⊥ external transmit : E; msg S : M passive atom Stage3 controls pc, msg R reads pc, transmit, done C awaits transmit, msg S , done C init [] true → pc := receive; msg R := M update [] pc = receive ∧ transmit?

What remains to be specified are the initial values of out and state. The initial output of the latch is arbitrary (this is a second source of nondeterminism). The initial state of the latch is computed combinationally from the initial values of out, set, and reset as during update rounds (in particular, if both set and reset are initially 0, then the initial value of state is determined by the initial value of out). The resulting module SyncLatch is active, because in every round a new output is issued independently of any input change, and synchronous, because after an input change the output changes in the very next round (unit delay).

In those update rounds in which the next value of tick is equal to the current value, no clock tick happens. In other words, the clock ticks are represented by the tick events. If a boolean variable x is used to model pure events, then we are interested in all changes to the value of x, but the actual value of x at the beginning or end of any given round is irrelevant. Hence, Rml provides a special type, denoted E, for the modeling of pure events. The variables of type E are called event variables.

Download PDF sample

Rated 4.21 of 5 – based on 35 votes