Temporal-logic Queries

Chan, William

doi:10.1007/10722167_34

Cited by 86 publications

(115 citation statements)

References 13 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…Theorem 4.4 is not in contradiction with Theorem 1 of [Cha00], where the validity of a CTL query is shown to be EXPTIME-complete. Indeed, we ask here the question of the existence and uniqueness of a minimal solution for one query in the given model, and not in all models as in [Cha00].…”

Section: Computing Unique Minimal Solutionsmentioning

confidence: 82%

“…Such an evaluation will tell whether, in practice, temporal queries often have a small number of minimal solutions, whether only computing a partial sample of the full set of minimal solutions can be useful for understanding and validating the model at hand. In principle, and because it has less limitations, our algorithm must be at least as useful as Chan's algorithm, for which he provided convincing application examples [Cha00].…”

Section: Discussionmentioning

confidence: 99%

“…Therefore, the set of solutions to a positive γ can be represented by its minimal elements, the minimal solutions (called maximally strong solutions in [BG01]). From a practical viewpoint, these solutions are the most informative [Cha00,BG01]. In our earlier example, (Q) is a negative query, and the minimal solutions are the weakest conditions that always ensure an eventual grant.…”

Section: Introductionmentioning

confidence: 98%

“…In a recent paper [Cha00], Chan proposed temporal logic queries as an extension of model checking (inspired by database queries). A temporal query is a temporal formula γ(?)…”

Section: Introductionmentioning

confidence: 99%

“…G F grant is satisfied (grants need no request, likely to be a severe bug in our design). We refer to [Cha00,BG01] for more motivations and examples on the role temporal queries can play in the modeling and validation of systems.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On Solving Temporal Logic Queries

Hornus

Schnoebelen

2002

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

Abstract. Temporal query checking is an extension of temporal model checking where one asks what propositional formulae can be inserted in a temporal query (a temporal formula with a placeholder) so that the resulting formula is satisfied in the model at hand. We study the problem of computing all minimal solutions to a temporal query without restricting to so-called "valid" queries (queries guaranteed to have a unique minimal solution). While this problem is intractable in general, we show that deciding uniqueness of the minimal solution (and computing it) can be done in polynomial-time.

show abstract

Section: Computing Unique Minimal Solutionsmentioning

confidence: 82%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

“…In a recent paper [Cha00], Chan proposed temporal logic queries as an extension of model checking (inspired by database queries). A temporal query is a temporal formula γ(?)…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On Solving Temporal Logic Queries

Hornus

Schnoebelen

2002

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

show abstract

A review of microservices autoscaling with formal verification perspective

2022

View full text Add to dashboard Cite

The process of scaling microservices is a challenging task, especially in maintaining optimum resource provisioning while respecting QoS constraints and SLA.Many research works have proposed autoscaling approaches for microservices, however, less likely concerned with the correctness guarantee of the proposed algorithms. Hence, it is significant to gather and summarize these approaches to foster future innovation. Meanwhile, a few reviews have been published concerning microservices from different aspects. Therefore, our review complements the existing by focusing on autoscaling with verification perspectives. This study highlights the recent contributions in three inter-related main topics that were published within the year 2017 to 2022, namely, microservice, verification, and autoscaling. Due to limited resources on verification for microservice autoscaling, we widen the perspective by considering the verification for autoscaling in cloud-based systems. Based on our findings, we found that the formal method is not a new thing in verifying the autoscaling policies in cloud-based systems, and one recent study that implements the formal method in the microservices area has been identified. Apart from the autoscaling techniques, we have also determined several factors that have been a concern in scaling the microservices as well as the relatable metrics. Meanwhile, from a verification perspective, we identified that probabilistic model checking is the common formal verification technique used to verify microservices and cloud autoscaling. Finally, we recommend open challenges from two perspectives which highlight the verification for existing microservice autoscaling and verification for ML-based microservice autoscaling.

show abstract

Multi-valued Model Checking Games

Shoham

Grumberg

2005

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

This work extends the game-based framework of µ-calculus model checking to the multi-valued setting. In multi-valued model checking a formula is interpreted over a Kripke structure defined over a lattice. The value of the formula is also an element of the lattice. We define a new game for this problem and derive from it a direct model checking algorithm that handles the multi-valued structure without any reduction. We investigate the properties of the new game, both independently, and in comparison to the automata-based approach. We show that the usual resemblance between the two approaches does not hold in the multivalued setting and show how it can be regained by changing the nature of the game.

show abstract

Temporal-logic Queries

Cited by 86 publications

References 13 publications

On Solving Temporal Logic Queries

On Solving Temporal Logic Queries

A review of microservices autoscaling with formal verification perspective

Multi-valued Model Checking Games

Contact Info

Product

Resources

About