On the public citation graph
Expressibility results for linear-time and branching-time logics
0 signed · 82 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.1007/3-540-17660-8_60openalex-snapshot
Characterizing Kripke structures in temporal logic
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.1038/190864b0openalex-snapshot
Journal of the Association for Computing Machinery
inferredcites →https://doi.org/10.1109/swct.1963.8openalex-snapshot
Infinite sequences and finite machines
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
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/567067.567081openalex-snapshot
"Sometimes" and "not never" revisited
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.21236/ada188620openalex-snapshot
Characterizing Kripke Structures in Temporal Logic.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8149-9_4openalex-snapshot
LTL’s Intuitive Representations and Its Automaton Translation
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/3-540-45726-7_3openalex-snapshot
ω-Regular Languages Are Testable with a Constant Number of Queries
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_8openalex-snapshot
Vacuity Detection in Temporal Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_63openalex-snapshot
A graphic language based on timing diagrams
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_19openalex-snapshot
Verification tools for finite-state concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_72openalex-snapshot
Another look at LTL model checking
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_31openalex-snapshot
On the complexity of branching modular model checking
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_83openalex-snapshot
Automatic translation of natural language system specifications into temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferred← citeshttps://doi.org/10.1007/3-7908-1624-8_21openalex-snapshot
A Concept for Modelling and Validation of Web Based Presentation Templates
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_18openalex-snapshot
Taking Some Burden Off an Explicit CTL Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_2openalex-snapshot
Temporal Logic and Fair Discrete Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_29openalex-snapshot
Temporal Logic for Scenario-Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_9openalex-snapshot
Counterexamples Revisited: Principles, Algorithms, Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_4openalex-snapshot
Branching vs. Linear Time: Semantical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_19openalex-snapshot
Some Results on the Expressive Power and Complexity of LSCs
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_13openalex-snapshot
The Common Fragment of ACTL and LTL
inferred← citeshttps://doi.org/10.1007/978-3-540-85758-7_23openalex-snapshot
Evaluation of OrViA Framework for Model-Driven SOA Implementations: An Industrial Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_11openalex-snapshot
Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-19583-9_11openalex-snapshot
Variants of LTL Query Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_9openalex-snapshot
dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification
inferred← citeshttps://doi.org/10.1007/978-3-8348-9703-9openalex-snapshot
Eigenschaftsorientierte Beschreibung der logischen Architektur eingebetteter Systeme
inferred← citeshttps://doi.org/10.1007/bfb0028745openalex-snapshot
From pre-historic to post-modern symbolic model checking
inferred← citeshttps://doi.org/10.1007/bfb0055612openalex-snapshot
Sometimes and not never re-revisited: on branching versus linear time
inferred← citeshttps://doi.org/10.1007/s13198-023-02246-yopenalex-snapshot
Verification of transaction-aware web services composition through formal methods
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.009openalex-snapshot
Relating word and tree automata
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.1016/j.jbi.2019.103134openalex-snapshot
Reasoning about clinical guidelines based on algebraic data types and constraint logic programming
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.04.002openalex-snapshot
On the analysis of compensation correctness
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.004openalex-snapshot
ω -Regular languages are testable with a constant number of queries
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00012-1openalex-snapshot
Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80020-6openalex-snapshot
17 Automata-theoretic techniques for temporal reasoning
inferred← citeshttps://doi.org/10.1017/s0960129521000475openalex-snapshot
Branching-time logics and fairness, revisited
inferred← citeshttps://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferred← citeshttps://doi.org/10.1023/a:1026228213080openalex-snapshot
From Pre-Historic to Post-Modern Symbolic Model Checking
inferred← citeshttps://doi.org/10.1037/0000114-016openalex-snapshot
Where are we now, and where do we go from here?
inferred← citeshttps://doi.org/10.1093/bioinformatics/bti1048openalex-snapshot
Validation of qualitative models of genetic regulatory networks by model checking: analysis of the nutritional stress response in Escherichia coli
inferred← citeshttps://doi.org/10.1109/ecbs.2008.45openalex-snapshot
Model Checking with Graphical Validation Rules
inferred← citeshttps://doi.org/10.1109/hase.1999.809474openalex-snapshot
Model checking UML Statechart diagrams using JACK
inferred← citeshttps://doi.org/10.1109/icadlt.2013.6568431openalex-snapshot
From formal specifications to efficient test scenarios generation
inferred← citeshttps://doi.org/10.1109/iri.2004.1431509openalex-snapshot
Specification-based testing with linear temporal logic
inferred← citeshttps://doi.org/10.1109/lics.1995.523248openalex-snapshot
On the complexity of modular model checking
inferred← citeshttps://doi.org/10.1109/lics.1996.561360openalex-snapshot
Relating word and tree automata
inferred← citeshttps://doi.org/10.1109/lics.1998.705645openalex-snapshot
Freedom, weakness, and determinism: from linear-time to branching-time
inferred← citeshttps://doi.org/10.1109/lics.1998.705674openalex-snapshot
Linear vs. branching time: a complexity-theoretic perspective
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892332openalex-snapshot
The common fragment of CTL and LTL
inferred← citeshttps://doi.org/10.1109/time.2013.9openalex-snapshot
Incremental, Inductive Model Checking
inferred← citeshttps://doi.org/10.1145/1055686.1055689openalex-snapshot
From linear time to branching time
inferred← citeshttps://doi.org/10.1145/1391962.1391971openalex-snapshot
Simulation-based verification using Temporally Attributed Boolean Logic
inferred← citeshttps://doi.org/10.1145/3209108.3209143openalex-snapshot
Automaton-Based Criteria for Membership in CTL
inferred← citeshttps://doi.org/10.17169/refubium-13160openalex-snapshot
Contributions to the Analysis of Qualitative Models of Regulatory Networks
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.25560/12554openalex-snapshot
Solving parity games through fictitious play
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.3217/jucs-003-05-0689openalex-snapshot
Model Checking for Abstract State Machines
inferred← citeshttps://doi.org/10.5445/ir/1000005771openalex-snapshot
Model Checking for Energy Efficient Scheduling in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.70675/47c0f168z6806z460dz9c3fzeff81c4e7df7openalex-snapshot
Réseaux de Petri temporels à inhibitions / permissions : application à la modélisation et vérification de systèmes de tâches temps réel
inferred← citeshttps://doi.org/10.70675/d577d68cz444bz40a4z951fza32dbfafa076openalex-snapshot
Towards an integrative approach for the modeling and formal verification of biological regulatory networks
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.