Quantitative temporal reasoning

Emerson, E. Allen; Mok, Aloysius K.; Sistla, A. Prasad; Srinivasan, Jai

doi:10.1007/bf00355298

Cited by 141 publications

(98 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Intuitively, unitary TDCGSs are easier to handle because it is possible to verify ϕ = A ϕ 1 U =c ϕ 2 by dichotomy, i.e., by verifying A ϕ 1 U = c/2 ( A ϕ 1 U =c− c/2 ϕ 2 ), and so on [14]. That way, model-checking an U =ζ formula can be achieved in time O(log(ζ) · |A|).…”

Section: Unitary Tdcgssmentioning

confidence: 99%

See 1 more Smart Citation

Model-Checking Timed ATL for Durational Concurrent Game Structures

Laroussinie

Markey

Oreiby

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We extend the framework of ATL model-checking to "simply timed" concurrent game structures, i.e., multi-agent structures where each transition carry an integral duration (or interval thereof). While the case of single durations is easily handled from the semantics point of view, intervals of durations raise several interesting questions. Moreover subtle algorithmic problems have to be handled when dealing with model checking. We propose a semantics for which we develop efficient (PTIME) algorithms for timed ATL without equality constraints, while the general case is shown to be EXPTIME-complete.

show abstract

Section: Unitary Tdcgssmentioning

confidence: 99%

“…In order to lower the complexity of those algorithms, less expressive models and logics have been developed [14,9,17]. Those models are less expressive, but can be handled very efficiently, especially through symbolic model-checking algorithms using BDD techniques [8,20,9,19].…”

Section: Introductionmentioning

confidence: 99%

Model-Checking Timed ATL for Durational Concurrent Game Structures

Laroussinie

Markey

Oreiby

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In this setting, weights in weighted transition systems have been most often restricted to range over the nonnegative integers (mostly for representing timing information), and temporal logics have been augmented either with constrained modalities [Koy90,EMSS92] or with explicit variables [AH94], and efficient algorithms have been developed and implemented [BLN03,JLSØ13]. Models with both positive and negative weights have also been studied, but mostly qualitative behaviours alone have been analyzed (this is the case in counter automatasee [HKOW09,GHOW10,Haa12] for recent references), or quantitative constraints have been analyzed (in weighted Kripke structures or games [CDHR10,CRR12]).…”

Section: Introductionmentioning

confidence: 99%

Quantitative Verification of Weighted Kripke Structures

Bouyer

Gardy

Markey

2014

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. Extending formal verification techniques to handle quantitative aspects, both for the models and for the properties to be checked, has become a central research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal logics constraining the total and/or average weight. We prove decidability when only accumulated weight is constrained, while allowing average-weight constraints alone already is undecidable.

show abstract

“…In our state-event setting, the use of labeled transition relations permits the application of synchronous composition operators, thereby allowing interacting modules to perform synchronous execution of shared events such as ticks of a global discrete clock [17]. The tick events provide concurrent systems with a uniform notion of time, without the restrictiveness of the clock driven models such as [8] where one transition is one time step. An example use of tick events is Ostroff's RG2 graphs [18] that are employed for model checking Real-Time Temporal Logic (RTTL) properties.…”

Section: Introductionmentioning

confidence: 99%

Model Reduction of Modules for State-Event Temporal Logics

Lawford

Ostroff

Wonham

1996

Formal Description Techniques IX

View full text Add to dashboard Cite

In many Discrete-Event Systems (DES) both state and event information are of importance to the systems designer. Logics such as Ostroff's RTTL allow for the specification and verification of a system's state-event behavior. To make realistic problems amenable to analysis, a designer must typically decompose the system into subsystems (modules) and use algebraic abstraction (quotient systems) to obtain hierarchical system models that preserve the properties to be verified. In this paper we use state-event observational equivalence to perform model reduction for a subclass of formulas of state-event linear temporal logics, with particular attention being paid to a discrete time temporal logic that is a simplification of RTTL. The reduction technique allows limited use of immediate operators.

show abstract

Quantitative temporal reasoning

Cited by 141 publications

References 29 publications

Model-Checking Timed ATL for Durational Concurrent Game Structures

Model-Checking Timed ATL for Durational Concurrent Game Structures

Quantitative Verification of Weighted Kripke Structures

Model Reduction of Modules for State-Event Temporal Logics

Contact Info

Product

Resources

About