scientific article; zbMATH DE number 4119600

zbMATH Open0683.68013MaRDI QIDQ4733384FDOQ4733384

Authors: Jai Srinivasan, E. Allen Emerson 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• The temporal logic of branching time
• Decision procedures and expressiveness in the temporal logic of branching time
• Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity
• Branching-time temporal logic and tree automata
• Temporal logic and applications—a tutorial
• A branching time logic with past operators
• scientific article; zbMATH DE number 5790393
• Linear, branching time and joint closure semantics for temporal logic
• Complexity of branching temporal description logics
• Branching-time logics with path relativisation

zbMATH Keywords

tree automataprogram verificationdecision proceduresbranching-time temporal logicdynamic logicsfinite-state automata on infinite objects

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (33)

• “Sometimes” and “not never” revisited
• Automated analysis of mutual exclusion algorithms using CCS
• A logic of intentions and beliefs
• Title not available (Why is that?)
• A non-reified temporal logic
• An infinite hierarchy of temporal logics over branching time
• A survey on temporal logics for specifying and verifying real-time systems
• On the logic of cooperation and propositional control
• The temporal logic of branching time
• Title not available (Why is that?)
• Deciding full branching time logic
• Temporal logic and fair discrete systems
• Title not available (Why is that?)
• Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms
• Complexity of branching temporal description logics
• Query learning of derived \(\omega\)-tree languages in polynomial time
• Title not available (Why is that?)
• Programming Languages and Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic logic as a uniform framework for theorem proving in intensional logic
• Deduction systems for BDI logics with mental state consistency
• An action based framework for verifying logical and behavioural properties of concurrent systems
• Point algebras for temporal reasoning: Algorithms and complexity
• Title not available (Why is that?)
• A resolution calculus for the branching-time temporal logic CTL
• Model checking properties on reduced trace systems
• Labelled natural deduction for a bundled branching temporal logic
• Branching time? Pruning time!
• Temporal Logics with Reference Pointers and Computation Tree Logics
• An initial study of time complexity in infinite-domain constraint satisfaction
• Title not available (Why is that?)
• Branching-time logics with path relativisation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733384)