A graphical interval logic for specifying concurrent systems

Dillon, Laura K.; Kutty, G.; Moser, Louise E.; Melliar-Smith, P. M.; Ramakrishna, Y. S.

doi:10.1145/192218.192226

Cited by 77 publications

(43 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…If existing windows-based logics also prove insufficient for cleanly capturing timing-diagram-like specifications, developing native verification techniques for timing diagrams may well prove beneficial. Similar comparisons to interval-based temporal logics would also be instructive [4,11]. Finally, it would be useful to understand the shapes of partial orders that designers frequently express in timing diagrams in practice.…”

Section: Perspectivementioning

confidence: 99%

Temporal Modalities for Concisely Capturing Timing Diagrams

Chockler¹,

Fisler²

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both partial orders on events and don't-care regions to LTL potentially yields exponentially larger formulas containing several non-localized terms corresponding to the same event. This raises a more fundamental question: which modalities allow a textual temporal logic to capture such diagrams using a single term for each event? We define the shapes of partial orders that are captured concisely by a hierarchy of textual linear temporal logics containing future and past time operators, as well Laroussinie et al's forgettable past operator and our own unforeseen future operator. Our results give insight into the temporal abstractions that underlie timing diagrams and suggest that the abstractions in LTL are significantly weaker than those captured by timing diagrams.

show abstract

Section: Perspectivementioning

confidence: 99%

Temporal Modalities for Concisely Capturing Timing Diagrams

Chockler¹,

Fisler²

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…RTGIL provides the capability of expressing real-time properties, which distinguishes it from other logics such as Graphical Interval Logic (GIL) [Dillon et al 1994] and the well-studied Propositional Temporal Logic (PTL) [Manna and Pnueli 1992]. GIL is, in fact, equivalent in expressiveness to PTL without the next operator [Kutty et al 1995].…”

Section: Comparison With Gil and Ptlmentioning

confidence: 99%

“…From that textual logic and its graphical depictions, we developed GIL [Dillon et al 1994], a logic less powerful than RTGIL in that it is defined on a discrete, rather than a dense, time line and has no capabilities for reasoning about real time. The decidability of GIL and RTGIL are established in Ramakrishna et al [1996a; by means of automata-theoretic decision algorithms, which are less suited to mechanization than the tableau procedure described here and implemented in the RTGIL environment.…”

Section: Design Of Concurrent Real-time Systemsmentioning

confidence: 99%

See 1 more Smart Citation

A graphical environment for the design of concurrent real-time systems

Moser

Ramakrishna

Kutty³

et al. 1997

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

Concurrent real-time systems are among the most difficult systems to design because of the many possible interleavings of events and because of the timing requirements that must be satisfied. We have developed a graphical environment based on Real-Time Graphical Interval Logic (RTGIL) for specifying and reasoning about the designs of concurrent real-time systems. Specifications in the logic have an intuitive graphical representation that resembles the timing diagrams drawn by software and hardware engineers, with real-time constraints that bound the durations of intervals. The syntax-directed editor of the RTGIL environment enables the user to compose and edit graphical formulas on a workstation display; the automated theorem prover mechanically checks the validity of proofs in the logic; and the database and proof manager tracks proof dependencies and allows formulas to be stored and retrieved. This article describes the logic, methodology, and tools that comprise the prototype RTGIL environment and illustrates the use of the environment with an example application.

show abstract

“…Unlike these logics, the formal specification language FIL which our tool uses, allows the succinct construction of bounded temporal contexts, thanks to its key element, the interval, which defines such contexts clearly and concisely. In addition to the textual representation of its formulas, this logic also has a natural, intuitive, graphical representation, called GIL (Graphical Interval Logic) [1], and both the textual and graphical representation are semantically equivalent. This paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Towards a More Intuitive Specification and Automatic Verification of System Properties with FBT: A Tool for Translating Interval Formulas into Büchi Automata

2004

Proceedings of the 2nd International Workshop on Verification and Validation of Enterprise Information Systems

View full text Add to dashboard Cite

Abstract. This paper presents the FBT (FIL to Büchi automaton Translator) tool which automatically translates any formula from FIL (Future Interval Logic) into its semantically equivalent Büchi automaton. There are two advantages of using this logic for specifying and verifying system properties instead of other more traditional and extended temporal logics, such as LTL (Linear Temporal Logic): firstly, it allows a succinct construction of specific temporal contexts, where certain properties must be evaluated, thanks to its key element, the interval; and secondly, it also permits a natural, intuitive, graphical representation. The underlying algorithm of the tool is based on the tableau method and is specially intended for application in on-the-fly model checking. In addition to a description of the design and implementation structure of FBT, we also present some experimental results obtained by our tool, and compare these results with the ones produced by another tool of similar characteristics (i.e. based on an on-the-fly tableau algorithm), but for LTL.

show abstract

A graphical interval logic for specifying concurrent systems

Cited by 77 publications

References 10 publications

Temporal Modalities for Concisely Capturing Timing Diagrams

Temporal Modalities for Concisely Capturing Timing Diagrams

A graphical environment for the design of concurrent real-time systems

Towards a More Intuitive Specification and Automatic Verification of System Properties with FBT: A Tool for Translating Interval Formulas into Büchi Automata

Contact Info

Product

Resources

About