Results 1 
7 of
7
A Graphical Interval Logic for Specifying Concurrent Systems
 ACM Transactions on Software Engineering and Methodology
, 1994
"... The paper describes a graphical interval logic that is the foundation of a toolset supporting formal specification and verification of concurrent software systems. Experience has shown that most software engineers find standard temporal logics difficult to understand and to use. The objective of ..."
Abstract

Cited by 63 (13 self)
 Add to MetaCart
The paper describes a graphical interval logic that is the foundation of a toolset supporting formal specification and verification of concurrent software systems. Experience has shown that most software engineers find standard temporal logics difficult to understand and to use. The objective of this work is to enable software engineers to specify and reason about temporal properties of concurrent systems more easily by providing them with a logic that has an intuitive graphical representation and with tools that support its use. To illustrate the use of the graphical logic, the paper provides some specifications for an elevator system and proves several properties of the specifications. The paper also describes the toolset and the implementation. 1 Introduction One of the great challenges facing today's software engineers is the development of correct programs for real applications. Recent advances in hardware reliability and fault tolerance technology can assure extremely lo...
Interval Logics and Their Decision Procedures  Part II: A RealTime Interval Logic
 Theoretical Computer Science
, 1996
"... In a companion paper, we presented an interval logic, and showed that it is elementarily decidable. In this paper we extend the logic to allow reasoning about realtime properties of concurrent systems; we call this logic RealTime Future Interval Logic (RTFIL). We model time by the real numbers, an ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In a companion paper, we presented an interval logic, and showed that it is elementarily decidable. In this paper we extend the logic to allow reasoning about realtime properties of concurrent systems; we call this logic RealTime Future Interval Logic (RTFIL). We model time by the real numbers, and allow our syntax to state the bounds on the duration of an interval. RTFIL possesses the "realtime interpolation property," which appears to be the natural quantitative counterpart of invariance under finite stuttering. As the main result of this paper, we show that RTFIL is decidable; the decision algorithm is slightly more expensive than for the untimed logic. Our decidability proof is based on the reduction of the satisfiability problem for the logic to the emptiness problem for timed Buchi automata. The latter problem was shown decidable by Alur and Dill in a landmark paper, in which this realtime extension of !automata was introduced. Finally, we consider an extension of the logic ...
The RealTime Graphical Interval Logic Toolset
 In Proceedings of the Conference on ComputerAided Verification, July/August
, 1996
"... Introduction The tools that we have developed for RealTime Graphical Interval Logic (RTGIL) are intended for specifying and reasoning about timebounded safety and liveness properties of concurrent realtime systems. These tools include a syntaxdirected editor that enables the user to construct g ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Introduction The tools that we have developed for RealTime Graphical Interval Logic (RTGIL) are intended for specifying and reasoning about timebounded safety and liveness properties of concurrent realtime systems. These tools include a syntaxdirected editor that enables the user to construct graphical formulas on a workstation display, a theorem prover based on a decision procedure that checks the validity of attempted proofs and produces a counterexample if an attempted proof is invalid, and a proof management and database system that tracks proof dependencies and allows graphical formulas to be stored and retrieved. 2 RealTime Graphical Interval Logic RTGIL is a lineartime temporal logic in which formulas are interpreted on traces of states indexed by the nonnegative real numbers. To exclude the occurrence of instantaneous states and Zeno runs, these traces are required to be right continuous and finitely variable. Right continuity requires that eac
Visual Specifications for Temporal Reasoning
 Journal of Visual Languages and Computing
"... Graphical Interval Logic (GIL) is a visual temporal logic in which formulas resemble the informal timing diagrams familiar to system designers and software engineers. It provides an intuitive and natural visual notation in which to express specifications for concurrent systems and retains the benefi ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Graphical Interval Logic (GIL) is a visual temporal logic in which formulas resemble the informal timing diagrams familiar to system designers and software engineers. It provides an intuitive and natural visual notation in which to express specifications for concurrent systems and retains the benefits of a formal notation. A visual editor permits GIL specifications to be easily constructed, and to be stored in and retrieved from files. The editor interfaces with a proof checker and model generator, which permit verification of temporal inferences. The paper shows how graphical specifications are created and used to reason about temporal properties of systems. It shows how pictures that formalize temporal arguments enhance understanding and help motivate successful proof strategies. 1 Introduction Temporal logic [7] provides a rigorous framework for expressing temporal properties of concurrent systems and has been a focus of much research activity in the last decade. Temporal logic spe...
Towards Diagrammability and Efficiency in Event Sequence Languages
"... Abstract. Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardware specific, as well as efficient to verify. While the formal verification community has formal models for asse ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardware specific, as well as efficient to verify. While the formal verification community has formal models for assessing the efficiency of an event sequence language, none of these models also account for designer friendliness. We propose an intermediate language for event sequences that addresses both concerns. The language achieves usability through a correlation to timing diagrams; its efficiency arises from its mapping into deterministic weak automata. We present the language, relate it to existing event sequence languages, and prove its relationship to deterministic weak automata. These results indicate that timing diagrams can become more expressive while remaining more efficient for symbolic model checking than LTL. 1
Automated Deduction in a Graphical Temporal Logic
 Journal of Applied NonClassical Logics
, 1996
"... . RealTime Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. RealTime Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automated deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the logic and produces counterexamples to invalid proofs. The user interface includes a graphical editor that enables the user to create graphical formulas on a workstation display, and a database and proof manager that tracks proof dependencies and allows graphical formulas to be stored and retrieved. In this paper we describe the logic, the automated deduction system, and an application to robotics. KEYWORDS: Automated Deduction, Buchi Automaton, Graphical Representation, Interval Logic, RealTime, Temporal Logic. Introduction Real systems...