Pages that link to "Item:Q3769957"
From MaRDI portal
The following pages link to The complexity of propositional linear temporal logics (Q3769957):
Displaying 44 items.
- Team semantics for the specification and verification of hyperproperties (Q5005106) (← links)
- (Q5013884) (← links)
- Probabilistic Temporal Logics (Q5024714) (← links)
- Property-oriented expansion (Q5030184) (← links)
- Unifying models (Q5047155) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- (Q5079753) (← links)
- (Q5090950) (← links)
- Suitability of the propositional temporal logic to express properties of real-time systems (Q5096770) (← links)
- (Q5111621) (← links)
- (Q5129940) (← links)
- Knowledge-based programs (Q5137342) (← links)
- Cyclic Proofs for Linear Temporal Logic (Q5221853) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- (Q5376664) (← links)
- A GENERAL NOTION OF UNIFORM STRATEGIES (Q5406294) (← links)
- Some Results on the Expressive Power and Complexity of LSCs (Q5452186) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths (Q5458863) (← links)
- (Q5460163) (← links)
- AN NP-COMPLETE FRAGMENT OF LTL (Q5462673) (← links)
- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers (Q5505598) (← links)
- Developments in Language Theory (Q5711966) (← links)
- Embedding theorems for LTL and its variants (Q5740619) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- Temporal Logic with Recursion. (Q6060093) (← links)
- One-pass Context-based Tableaux Systems for CTL and ECTL (Q6060101) (← links)
- (Q6060107) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- Synchronizing words under \textsf{LTL} constraints (Q6161453) (← links)
- A space-efficient on-the-fly algorithm for real-time model checking (Q6162102) (← links)
- An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)
- Incentive Engineering for Concurrent Games (Q6199620) (← links)
- Parametrized modal logic. II: The unidimensional case (Q6550519) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Probabilistic temporal logic with countably additive semantics (Q6560997) (← links)
- Unary and two-variable interval logics (Q6601763) (← links)
- SAT meets tableaux for linear temporal logic satisfiability (Q6611959) (← links)
- Deciding hyperproperties combined with functional specifications (Q6649493) (← links)
- Gödel-Dummett linear temporal logic (Q6665714) (← links)
