On the public citation graph
On ACTL Formulas Having Linear Counterexamples
0 signed · 32 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-56922-7_5openalex-snapshot
BDD-Based debugging of designs using language containment and fair CTL
inferredcites →https://doi.org/10.1007/3-540-58043-3openalex-snapshot
A Decade of Concurrency Reflections and Perspectives
inferredcites →https://doi.org/10.1007/3-540-58043-3_19openalex-snapshot
Verification tools for finite-state concurrent systems
inferredcites →https://doi.org/10.1016/0950-5849(91)90083-nopenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0004-3702(99)00039-9openalex-snapshot
Enhancing model checking in verification by AI techniques
inferredcites →https://doi.org/10.1145/217474.217565openalex-snapshot
Efficient generation of counterexamples and witnesses in symbolic model checking
inferredcites →https://doi.org/10.1145/345099.345104openalex-snapshot
An automata-theoretic approach to modular model checking
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11693017_11openalex-snapshot
Automated Support for Building Behavioral Models of Event-Driven Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_8openalex-snapshot
Producing Explanations for Rich Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_91openalex-snapshot
A Syntactic Characterization of Distributive LTL Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-30232-2_17openalex-snapshot
Witness and Counterexample Automata for ACTL
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-45220-1_38openalex-snapshot
Validity of CTL Queries Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-15384-6_15openalex-snapshot
ACTL Local Model Update with Constraints
inferred← citeshttps://doi.org/10.1007/s10009-018-0483-8openalex-snapshot
Spatio-temporal model checking of vehicular movement in public transport systems
inferred← citeshttps://doi.org/10.1007/s11390-009-9208-5openalex-snapshot
Improved Bounded Model Checking for the Universal Fragment of CTL
inferred← citeshttps://doi.org/10.1016/j.artint.2014.02.005openalex-snapshot
CTL update of Kripke models through protections
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.008openalex-snapshot
Linear templates of ACTL formulas with an application to SAT-based verification
inferred← citeshttps://doi.org/10.1109/access.2022.3143478openalex-snapshot
Generating and Employing Witness Automata for ACTLW Formulae
inferred← citeshttps://doi.org/10.1109/ecbs.2003.1194802openalex-snapshot
Model checking and evidence exploration
inferred← citeshttps://doi.org/10.1109/lics.2002.1029814openalex-snapshot
Tree-like counterexamples in model checking
inferred← citeshttps://doi.org/10.1142/s0218194020500199openalex-snapshot
Winning Strategy Tree Construction for BDD-Based ATL Model Checkers
inferred← citeshttps://doi.org/10.1145/1740582.1740588openalex-snapshot
On the distributivity of LTL specifications
inferred← citeshttps://doi.org/10.1613/jair.2420openalex-snapshot
CTL Model Update for System Modifications
inferred← citeshttps://doi.org/10.29007/2s1qopenalex-snapshot
Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-615openalex-snapshot
Foundations of Tree-like Local Model Updates
inferred← citeshttps://doi.org/10.4204/eptcs.78.4openalex-snapshot
Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
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.