Time and logic: A calculus of binary events (Q1805011): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Defining liveness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5812175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Outline of a Theory of Truth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Specifying Concurrent Program Modules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The ``Hoare Logic'' of CSP, and All That / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636857 / rank | |||
Normal rank |
Latest revision as of 13:18, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time and logic: A calculus of binary events |
scientific article |
Statements
Time and logic: A calculus of binary events (English)
0 references
13 December 1995
0 references
Time is not viewed as a fundamental notion but as a notion deduced from the concept of causality: ``First we introduce the notion of a binary event which generates a bit and thereby marks a point of time. Assuming causality between the binary events allows to map a coherent set of binary events into a simultaneity set of a single point of time. This set provides the base for the definition of an algebra over binary events and a logic over time-bound propositions''. A functional/operational complete and modular method of specification for processing systems can be derived. The modules are able to describe separately the liveness and, respectively, safety properties of the systems. The ``core'' concept introduced here is the so-called bent algebra (and, in fact, also the bent logic). The criticism of other existing time-dependent formalisms for analysing concurrent systems is ``tough'': ``As a conclusion, bent algebra is more general, more expressive and much easier to handle than temporal logics''; only by ``extending time to infinity we can construct a bridge from temporal logic to bent logic''.
0 references
process logic
0 references
computation theory
0 references
three-valued algebra
0 references
specification of processing systems
0 references
causality
0 references
bit
0 references
point of time
0 references
algebra over binary events
0 references
logic over time-bound propositions
0 references
liveness
0 references
safety
0 references
bent algebra
0 references
bent logic
0 references
concurrent systems
0 references