On the public citation graph
Sometimes and not never re-revisited: on branching versus linear time
0 signed · 65 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/3-540-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-16761-7_77openalex-snapshot
Alternating automata, the weak monadic theory of the tree, and its complexity
inferredcites →https://doi.org/10.1007/3-540-18088-5_22openalex-snapshot
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
inferredcites →https://doi.org/10.1007/3-540-49519-3_9openalex-snapshot
Bisimulation Minimization in an Automata-Theoretic Verification Framework
inferredcites →https://doi.org/10.1007/3-540-52590-4_43openalex-snapshot
A unified approach for showing language containment and equivalence between various types of ω-automata
inferredcites →https://doi.org/10.1007/3-540-58043-3_19openalex-snapshot
Verification tools for finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-58325-4_202openalex-snapshot
Deterministic Ω automata vis-a-vis deterministic Buchi automata
inferredcites →https://doi.org/10.1007/3-540-60218-6_31openalex-snapshot
On the complexity of branching modular model checking
inferredcites →https://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
inferredcites →https://doi.org/10.1007/3-540-63166-6_27openalex-snapshot
A new heuristic for bad cycle detection using BDDs
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferredcites →https://doi.org/10.1007/978-0-387-35064-6_4openalex-snapshot
CTL and Equivalent Sublanguages of CTL
inferredcites →https://doi.org/10.1007/978-0-387-35358-6_21openalex-snapshot
Relating Linear and Branching Model Checking
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/bfb0013029openalex-snapshot
Expressibility results for linear-time and branching-time logics
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0020-0190(93)90069-lopenalex-snapshot
A unified approach for showing language inclusion and equivalence between various types of ω-automata
inferredcites →https://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71929-3openalex-snapshot
Weakly Definable Relations and Special Automata
inferredcites →https://doi.org/10.1023/a:1008727508722openalex-snapshot
A New Heuristic for Bad Cycle Detection Using BDDs
inferredcites →https://doi.org/10.1109/lics.1995.523248openalex-snapshot
On the complexity of modular model checking
inferredcites →https://doi.org/10.1109/lics.1996.561360openalex-snapshot
Relating word and tree automata
inferredcites →https://doi.org/10.1109/lics.1998.705645openalex-snapshot
Freedom, weakness, and determinism: from linear-time to branching-time
inferredcites →https://doi.org/10.1109/lics.1998.705674openalex-snapshot
Linear vs. branching time: a complexity-theoretic perspective
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11575467_6openalex-snapshot
An Abstract Interpretation Perspective on Linear vs. Branching Time
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_4openalex-snapshot
Branching vs. Linear Time: Semantical Perspective
inferred← citeshttps://doi.org/10.1016/j.ic.2006.01.001openalex-snapshot
Incompleteness of states w.r.t. traces in model checking
inferred← citeshttps://doi.org/10.1016/j.jbi.2010.02.009openalex-snapshot
Authoring and verification of clinical guidelines: A model driven approach
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.11606/t.45.2007.tde-09042008-105750openalex-snapshot
Planejamento sob incerteza para metas de alcançabilidade estendidas
inferred← citeshttps://doi.org/10.26686/wgtn.17004076openalex-snapshot
On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures
inferred← citeshttps://doi.org/10.26686/wgtn.17004076.v1openalex-snapshot
On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures
inferred← citeshttps://doi.org/10.3990/1.9789036527347openalex-snapshot
Graph-based software specification and verification
inferred← citeshttps://doi.org/10.48550/arxiv.1710.09887openalex-snapshot
Critical trees: counterexamples in model checking of CSM systems using CBS algorithm
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.