Results 1  10
of
910,712
Predicate Diagrams for the Verification of RealTime Systems
"... This article discusses a new format of predicate diagrams for the verification of realtime systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modelling data, possibly over infinite domains. Predicate diagrams are succinc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This article discusses a new format of predicate diagrams for the verification of realtime systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modelling data, possibly over infinite domains. Predicate diagrams
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
not impair the symbolic verification of "implementable" realtime programsthose whose safety...
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
Supporting RealTime Applications in an Integrated Services Packet Network: Architecture and Mechanism
, 1992
"... This paper considers the support of realtime applications in an ..."
Abstract

Cited by 575 (25 self)
 Add to MetaCart
This paper considers the support of realtime applications in an
PVS: A Prototype Verification System
 CADE
, 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract

Cited by 654 (16 self)
 Add to MetaCart
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available
The synchronous approach to reactive and realtime systems
 Proceedings of the IEEE
, 1991
"... This special issue is devoted to the synchronous approach to reactive and realtime programming. This introductory paper presents and discusses the application fields and the principles of synchronous programming. The major concern of the synchronous approach is to base synchronous programming langu ..."
Abstract

Cited by 440 (14 self)
 Add to MetaCart
languages on mathematical models. This makes it possible to handle compilation, logical correctness proofs, and verifications of realtime programs in a formal way, leading to a clean and precise methodology for design and programming. 1. INTRODUCTION: REALTIME AND REACTIVE SYSTEMS It is commonly accepted
Why a diagram is (sometimes) worth ten thousand words
 Cognitive Science
, 1987
"... We distinguish diagrammatic from sentential paperandpencil representationsof information by developing alternative models of informationprocessing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential, li ..."
Abstract

Cited by 777 (2 self)
 Add to MetaCart
We distinguish diagrammatic from sentential paperandpencil representationsof information by developing alternative models of informationprocessing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
DiagramBased Verification of RealTime Systems using Timed Predicate Diagrams
"... Computers are frequently used in critical applications where predictable response times are essential for correctness. Such systems are called realtime systems and are a class of reactive systems. Many verification methods for verifying reactive systems were proposed, including diagrambased verifi ..."
Abstract
 Add to MetaCart
Computers are frequently used in critical applications where predictable response times are essential for correctness. Such systems are called realtime systems and are a class of reactive systems. Many verification methods for verifying reactive systems were proposed, including diagram
Virtual Time and Global States of Distributed Systems
 PARALLEL AND DISTRIBUTED ALGORITHMS
, 1988
"... A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a consiste ..."
Abstract

Cited by 741 (6 self)
 Add to MetaCart
A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a
Results 1  10
of
910,712