Pages that link to "Item:Q3317085"

The following pages link to Temporal logic can be more expressive (Q3317085):

Displaying 50 items.

• A generalized time quantifier approach to approximate reasoning (Q1885721) (← links)
• Interpreting message flow graphs (Q1904641) (← links)
• Almost event-rate independent monitoring (Q2008287) (← links)
• Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
• One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
• Temporal logic with recursion (Q2051830) (← links)
• Incorporating monitors in reactive synthesis without paying the price (Q2147214) (← links)
• Temporal logics with language parameters (Q2232279) (← links)
• First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
• Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
• Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• Bounded model checking of infinite state systems (Q2369883) (← links)
• The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
• Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
• Model checking of pushdown systems for projection temporal logic (Q2424879) (← links)
• Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
• LTL is closed under topological closure (Q2448112) (← links)
• A decision procedure for propositional projection temporal logic with infinite models (Q2480780) (← links)
• The stuttering principle revisited (Q2484066) (← links)
• Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
• Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
• LTL over integer periodicity constraints (Q2503321) (← links)
• From complementation to certification (Q2575735) (← links)
• Complexity of modal logics with Presburger constraints (Q2638188) (← links)
• Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
• Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
• Expressive completeness for LTL with modulo counting and group quantifiers (Q2825418) (← links)
• Egalitarian State-Transition Systems (Q2827838) (← links)
• Axiomatic semantics of projection temporal logic programs (Q3060195) (← links)
• Expressive completeness of modal logic on binary ramified frames (Q3130048) (← links)
• Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
• Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
• Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
• (Q3384896) (← links)
• 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
• One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
• From Philosophical to Industrial Logics (Q3601803) (← links)
• Complexity of propositional projection temporal logic with star (Q3616217) (← links)
• A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time (Q3643267) (← links)
• Temporal logics of “the next” do not have the beth property (Q4240680) (← links)
• Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689) (← links)
• Separation logics and modalities: a survey (Q4586138) (← links)
• Serializable histories in quantified propositional temporal logic (Q4652741) (← links)
• Property-Based Testing for Spark Streaming (Q4957189) (← links)
• An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
• (Q5013884) (← links)
• (Q5015276) (← links)
• (Q5020519) (← links)
• A derivation-loop method for temporal logic (Q5040806) (← links)