On the public citation graph

A Tableau for Bundled CTL

https://doi.org/10.1093/logcom/exl033
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11590156_31openalex-snapshot
Towards a CTL* Tableau
inferredcites →https://doi.org/10.1007/3-540-45694-5_2openalex-snapshot
A Deductive Proof System for CTL*
inferredcites →https://doi.org/10.1007/3-540-69778-0_28openalex-snapshot
A New One-Pass Tableau Calculus for PLTL
inferredcites →https://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferredcites →https://doi.org/10.1007/bf00370320openalex-snapshot
Decidability for branching time
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/0304-3975(83)90082-8openalex-snapshot
Alternative semantics for temporal logics
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/j.ic.2005.03.005openalex-snapshot
An axiomatization of PCTL*
inferredcites →https://doi.org/10.1016/s0019-9958(84)80047-9openalex-snapshot
Deciding full branching time logic
inferredcites →https://doi.org/10.1016/s1574-6526(05)80011-2openalex-snapshot
Theorem-Proving for Discrete Temporal Logic
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1109/lics.2002.1029847openalex-snapshot
Decidable and undecidable fragments of first-order branching temporal logics
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1145/22145.22173openalex-snapshot
Improved upper and lower bounds for modal logics of programs
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.2307/2273296openalex-snapshot
Logic and time
inferredcites →https://doi.org/10.2307/2695091openalex-snapshot
An axiomatization of full Computation Tree Logic
inferredcites →https://doi.org/10.5075/epfl-thesis-2215openalex-snapshot
Deductive local model checking : on the verification of CTL* properties of infinite-state reactive systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-24312-2_3openalex-snapshot
A Tableau for Bundled Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-48758-8_10openalex-snapshot
Decidability and Expressivity of Ockhamist Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_25openalex-snapshot
A Tableau for RoBCTL
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_23openalex-snapshot
A Labeled Natural Deduction System for a Fragment of CTL *
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_26openalex-snapshot
A Tableau for CTL*
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_31openalex-snapshot
Branching Time? Pruning Time!
inferred← citeshttps://doi.org/10.1007/978-3-642-39992-3_22openalex-snapshot
Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*
inferred← citeshttps://doi.org/10.1007/s00165-011-0193-4openalex-snapshot
A tableau-based decision procedure for CTL*
inferred← citeshttps://doi.org/10.1007/s10472-017-9546-xopenalex-snapshot
To be fair, use bundles
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.008openalex-snapshot
A Solver for Modal Fixpoint Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.014openalex-snapshot
A History of Until
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.10.012openalex-snapshot
A Rooted Tableau for BCTL*
inferred← citeshttps://doi.org/10.1016/j.ic.2019.02.003openalex-snapshot
Sublogics of a branching time logic of robustness
inferred← citeshttps://doi.org/10.1016/j.jal.2016.12.003openalex-snapshot
Rewrite rules for CTL*
inferred← citeshttps://doi.org/10.1080/11663081.2013.830401openalex-snapshot
A natural deduction system for bundled branching time logic
inferred← citeshttps://doi.org/10.1093/logcom/exq028openalex-snapshot
Labelled natural deduction for a bundled branching temporal logic
inferred← citeshttps://doi.org/10.1109/time.2010.7openalex-snapshot
CTL-Like Fragments of a Temporal Logic of Robustness
inferred← citeshttps://doi.org/10.1109/time.2012.17openalex-snapshot
A Tableau for the Combination of CTL and BCTL
inferred← citeshttps://doi.org/10.1109/time.2014.22openalex-snapshot
Fairness with EXPTIME Bundled CTL Tableau
inferred← citeshttps://doi.org/10.1109/time.2014.25openalex-snapshot
Verification of Rewrite Rules for Computation Tree Logics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.