On the public citation graph

Computation tree logic and regular ω-languages

https://doi.org/10.1007/bfb0013041
0 signed · 51 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/3-540-12896-4_383openalex-snapshot
Yet another process logic
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-51237-3_7openalex-snapshot
A synthesis of two approaches for verifying finite state concurrent systems
inferredcites →https://doi.org/10.1007/bfb0027043openalex-snapshot
Infinitary languages: Basic theory and applications to concurrent systems
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0030294openalex-snapshot
Recent results on automata and infinite words
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0019-9958(79)90629-6openalex-snapshot
Star-free regular sets of ω-sequences
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0022-0000(71)80006-5openalex-snapshot
Classification of noncounting events
inferredcites →https://doi.org/10.1016/s0049-237x(08)71684-7openalex-snapshot
Distributive Normal Forms in First-Order Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7085-5openalex-snapshot
Formal Systems and Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1093/logcom/2.5.605openalex-snapshot
A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11589976_5openalex-snapshot
State/Event Software Verification for Branching-Time Specifications
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_8openalex-snapshot
CTL* and ECTL* as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_68openalex-snapshot
Verifying ω-regular properties for a subclass of linear hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_31openalex-snapshot
Axiomatising extended computation tree logic
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_48openalex-snapshot
Model checking for extended timed temporal logics
inferred← citeshttps://doi.org/10.1007/978-3-030-63595-4_9openalex-snapshot
Strategies, Model Checking and Branching-Time Properties in Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_7openalex-snapshot
Satisfiability of ECTL* with Tree Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_32openalex-snapshot
Satisfiability of CTL* with Constraints
inferred← citeshttps://doi.org/10.1007/bfb0013020openalex-snapshot
Time, logic and computation
inferred← citeshttps://doi.org/10.1007/s00224-016-9724-yopenalex-snapshot
Satisfiability of ECTL∗ with Local Tree Constraints
inferred← citeshttps://doi.org/10.1007/s00236-012-0156-0openalex-snapshot
Stochastic game logic
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s10586-017-0757-zopenalex-snapshot
Software model checking for resources race
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90173-sopenalex-snapshot
R-generability, and definability in branching time logics
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.002openalex-snapshot
Satisfiability of ECTL⁎ with constraints
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100700openalex-snapshot
Strategies, model checking and branching-time properties in Maude
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.009openalex-snapshot
CTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.007openalex-snapshot
Unified temporal logic
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00094-1openalex-snapshot
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00083-2openalex-snapshot
Axiomatising extended computation tree logic
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1080/11663081.2000.10510998openalex-snapshot
Temporal Logics with Reference Pointers and Computation Tree Logics
inferred← citeshttps://doi.org/10.1109/lics.1995.523273openalex-snapshot
Efficient on-the-fly model checking for CTL
inferred← citeshttps://doi.org/10.1109/qest.2007.38openalex-snapshot
Stochastic Game Logic
inferred← citeshttps://doi.org/10.1109/qest.2007.45openalex-snapshot
Analysis of Local Address Scanning by Puppetnets
inferred← citeshttps://doi.org/10.1109/re.2013.6636706openalex-snapshot
On requirements verification for model refinements
inferred← citeshttps://doi.org/10.21236/ada482992openalex-snapshot
An Expressive Verification Framework for State/Event Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0814openalex-snapshot
Satisfiability of CTL* with constraints
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.