SLAP: Specification logic of actions with probability

نویسندگان

  • Gavin Rens
  • Thomas Andreas Meyer
  • Gerhard Lakemeyer
چکیده

A logic for specifying probabilistic transition systems is presented. Our perspective is that of agents performing actions. A procedure for deciding whether sentences in this logic are valid is provided. One of the main contributions of the paper is the formulation of the decision procedure: a tableau system which appeals to solving systems of linear equations. The tableau rules eliminate propositional connectives, then, for all open branches of the tableau tree, systems of linear equations are generated and checked for feasibility. Proofs of soundness, completeness and termination of the decision procedure are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Analysis of Security Protocols: Protocol Composition Logic a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

We develop Protocol Composition Logic (PCL) – a Floyd-Hoare style logic for axiomatic proofs of protocol properties that is sound with respect to the standard symbolic model of protocol execution and attack. PCL can express temporal ordering of actions and knowledge, naturally capturing security properties such as authentication and secrecy. The induction rule for proving invariants and the com...

متن کامل

Specification and Verification of a Secure Distributed Voting Protocol

The Timed-Buffer Distributed Voting Algorithm (TB-DVA), a secure distributed voting protocol, is introduced and described. A formal specification of the algorithm is developed using Lamport’s specification language TLA+. Then strategies for proving the correctness of the specification using Lamport’s Temporal Logic of Actions (TLA) are discussed.

متن کامل

TLA in Pictures

Predicate-action diagrams, which are similar to standard state-transition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specification—and those descriptions then proved correct— even when the complete specification cannot be written as a diagram. We also use the diagrams to illustrate proofs...

متن کامل

Formal Modeling of Security Properties of Computer Networks

Networks, mechanisms, services and processes are modeled as State Transition Systems. Verification and analysis apply Leslie Lamport’s Temporal Logic of Actions (TLA). The specification technique cTLA and a cTLA-based specification framework are used in order to support the modular description of systems and their structured verification. Moreover the cTLA-specifications used can be translated ...

متن کامل

Outcomes of Arthroscopic Biceps Tenodesis for the Treatment of Failed Type II SLAP Repair: A Minimum 2-Year Follow-Up

Background: To retrospectively review surgical outcomes of prospectively collected data on a series of patients whounderwent revision of a type II SLAP repair to arthroscopic biceps tenodesis due to an unsuccessful outcome.Methods: A retrospective review was performed on a cohort of patients who underwent arthroscopic biceps tenodesisfor a failed type II SLAP repair from 2010 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Logic

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2014