scientific article; zbMATH DE number 2196601
From MaRDI portal
Publication:5311048
zbMath1084.03013MaRDI QIDQ5311048
No author found.
Publication date: 22 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44)
Related Items (25)
The Complexity of Linear-Time Temporal Logic Model Repair ⋮ Social bot detection as a temporal logic model checking problem ⋮ Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Is my attack tree correct? ⋮ Taming strategy logic: non-recurrent fragments ⋮ Action and State Based Computation Tree Measurement Language and Algorithms ⋮ On the complexity of linear temporal logic with team semantics ⋮ Unnamed Item ⋮ Reasoning about graded strategy quantifiers ⋮ Unnamed Item ⋮ On the logic of cooperation and propositional control ⋮ Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic ⋮ Diagnosability analysis of patterns on bounded labeled prioritized Petri nets ⋮ A temporal logic for micro- and macro-step-based real-time systems: foundations and applications ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) ⋮ A Temporal Logic of Normative Systems ⋮ On the complexity of resource-bounded logics ⋮ Natural strategic ability ⋮ Computation tree measurement language (CTML) ⋮ Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ The model checking fingerprints of CTL operators ⋮ Model Checking and Validity in Propositional and Modal Inclusion Logics
Uses Software
This page was built for publication:
