Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

TCS
1998

favoriteEmaildiscussreport

103views Theoretical Computer Science» more TCS 1998»

Proving Possibility Properties

13 years 4 months ago

Proving Possibility Properties

Download research.microsoft.com

A method is described for proving “always possibly” properties of speciﬁcations in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA (Temporal Logic of Actions) speciﬁcations. Key words: Branching time, linear time, temporal logic.

Leslie Lamport

Real-time Traffic

Key Words | Linear-time Trace Semantics | TCS 1998 | Temporal Logic | Theoretical Computer Science |

claim paper

Related Content

» HalfOrder Modal Logic How to Prove RealTime Properties

» Proving transaction and systemlevel properties of untimed SystemC TLM designs

» On the possibility to create a compatiblecomplete unary comparison method for evolutionary...

» Possibility Theory for Reasoning About Uncertain Soft Constraints

» On the ImPossibility of ArthurMerlin Witness Hiding Protocols

» Proving Invariants of IO Automata with TAME

» A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering

» Structuring Optimizing Transformations and Proving Them Sound

» Foundational Compositional Codatatypes for HigherOrder Logic Category Theory Applied to Th...

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Leslie Lamport

Comments (0)