Results 1  10
of
13,111
Model checking TLA+ specifications
 Correct Hardware Design and Verification Methods
, 1999
"... Abstract. TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full firstorder logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finitestate model of the specificat ..."
Abstract

Cited by 63 (7 self)
 Add to MetaCart
Abstract. TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full firstorder logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finitestate model
Animating TLA Specifications
, 1999
"... . TLA (the Temporal Logic of Actions) is a linear temporal logic for specifying and reasoning about reactive systems. We define a subset of TLA whose formulas are amenable to validation by animation, with the intent to facilitate the communication between domain and solution experts in the design ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
in the design of reactive systems. 1 Introduction The Temporal Logic of Actions (TLA) has been proposed by Lamport [21] for the specification and verification of reactive and concurrent systems. TLA models describe infinite sequences of states, called behaviors, that correspond to the execution of the system
The Operators of TLA+
 Digital Equipment Corporation, SRC Technical Note 1997006a
, 1997
"... This document is an introduction to the syntax and semantics of the operators of TLA + . It assumes that you are familiar with ordinary mathematics (sets and functions) and are at least acquainted with TLA. It should enable you to understand the expressions that appear in TLA + specifications. This ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This document is an introduction to the syntax and semantics of the operators of TLA + . It assumes that you are familiar with ordinary mathematics (sets and functions) and are at least acquainted with TLA. It should enable you to understand the expressions that appear in TLA + specifications
Introduction to TLA
, 1994
"... Introduction to TLA Leslie Lamport d i g i t a l Systems Research Center 130 Lytton Avenue Palo Alto, California 94301 http://www.research.digital.com/SRC/ Copyright c flDigital Equipment Corporation 1997. All rights reserved A Simple Example We begin by specifying a system that starts wit ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
with x equal to 0 and keeps incrementing x by 1 forever. In a conventional programming language, this might be written initially x = 0 ; loop forever x := x + 1 end loop The TLA specification is a formula \Pi defined as follows, where the meaning of each conjunct is indicated by the comments. \Pi
A simple parallel algorithm for the maximal independent set problem
 SIAM Journal on Computing
, 1986
"... Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intel ..."
Abstract

Cited by 458 (10 self)
 Add to MetaCart
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intelligence. One of the main contributions of this paper is the development of powerful and general technicjues for converting Monte Carlo algorithms into deterministic algorithms. These techniques arc used to convert the Monte Carlo algorithm for the MIS problem into a simple deterministic algorithm with the same parallel running time. A maximal independent set (MIS) in an
Hybrid Systems in TLA+
, 1993
"... . TLA + is a general purpose, formal specification language based on the Temporal Logic of Actions, with no builtin primitives for specifying realtime properties. Here, we use TLA + to define operators for specifying the temporal behavior of physical components obeying integral equations of ev ..."
Abstract

Cited by 58 (6 self)
 Add to MetaCart
. TLA + is a general purpose, formal specification language based on the Temporal Logic of Actions, with no builtin primitives for specifying realtime properties. Here, we use TLA + to define operators for specifying the temporal behavior of physical components obeying integral equations
Reduction in TLA
 APPEARED IN CONCUR'98 CONCURRENCY THEORY
, 1998
"... Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarsergrained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than earlier ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarsergrained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than
Results 1  10
of
13,111