On the public citation graph
From PSL to NBA: a Modular Symbolic Encoding
0 signed · 49 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/10722167_21openalex-snapshot
Efficient Büchi Automata from LTL Formulae
inferredcites →https://doi.org/10.1007/11513988_10openalex-snapshot
Incremental and Complete Bounded Model Checking for Full PLTL
inferredcites →https://doi.org/10.1007/11513988_35openalex-snapshot
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
inferredcites →https://doi.org/10.1007/11812128_20openalex-snapshot
Symbolic Implementation of Alternating Automata
inferredcites →https://doi.org/10.1007/11813040_38openalex-snapshot
PSL Model Checking and Run-Time Verification Via Testers
inferredcites →https://doi.org/10.1007/11817963_12openalex-snapshot
Bounded Model Checking for Weak Alternating Büchi Automata
inferredcites →https://doi.org/10.1007/3-540-36577-x_6openalex-snapshot
Resets vs. Aborts in Linear Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-44612-5_65openalex-snapshot
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
inferredcites →https://doi.org/10.1007/3-540-45089-0_5openalex-snapshot
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
inferredcites →https://doi.org/10.1007/3-540-45687-2_37openalex-snapshot
An Improved Algorithm for the Membership Problem for Extended Regular Expressions
inferredcites →https://doi.org/10.1007/3-540-48683-6_44openalex-snapshot
NuSMV: A New Symbolic Model Verifier
inferredcites →https://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
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/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/s10009-003-0121-xopenalex-snapshot
Efficient reduction of finite state model checking to reachability analysis
inferredcites →https://doi.org/10.1007/s10009-010-0168-4openalex-snapshot
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(84)90049-5openalex-snapshot
Alternating finite automata on ω-words
inferredcites →https://doi.org/10.1016/0304-3975(92)90076-ropenalex-snapshot
Alternating automata, the weak monadic theory of trees and its complexity
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferredcites →https://doi.org/10.1109/fmcad.2006.19openalex-snapshot
From PSL to NBA: a Modular Symbolic Encoding
inferredcites →https://doi.org/10.1109/istcs.1997.595167openalex-snapshot
Weak alternating automata are not that weak
inferredcites →https://doi.org/10.1145/377978.377993openalex-snapshot
Weak alternating automata are not that weak
inferredcites →https://doi.org/10.3403/30257773openalex-snapshot
IEEE standard for property specification language (PSL)
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-1-4020-8297-9_17openalex-snapshot
Asynchronous On-Line Monitoring of Logical and Temporal Assertions
inferred← citeshttps://doi.org/10.1007/978-3-030-62822-2_7openalex-snapshot
Compiling FL$$^{res}$$ on Finite Words
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_10openalex-snapshot
Automata-Theoretic Model Checking Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_11openalex-snapshot
On the Merits of Temporal Testers
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_39openalex-snapshot
Syntactic Optimizations for PSL Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_53openalex-snapshot
Boolean Abstraction for Temporal Logic Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_15openalex-snapshot
On Regular Temporal Logics with Past,
inferred← citeshttps://doi.org/10.1007/978-3-642-04694-0_5openalex-snapshot
Monitor Circuits for LTL with Bounded and Unbounded Future
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_31openalex-snapshot
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-23120-9_6openalex-snapshot
From Assertion-Based Verification to Assertion-Based Synthesis
inferred← citeshttps://doi.org/10.1007/s00236-010-0118-3openalex-snapshot
On regular temporal logics with past
inferred← citeshttps://doi.org/10.1109/ddecs.2010.5491756openalex-snapshot
Synthesis of asynchronous monitors for critical electronic systems
inferred← citeshttps://doi.org/10.1109/idt.2008.4802507openalex-snapshot
Assertion-based verification and on-line testing in Horus
inferred← citeshttps://doi.org/10.1109/prime.2011.5966274openalex-snapshot
Synthesis of Quasi Delay Insensitive monitors
inferred← citeshttps://doi.org/10.1109/tcad.2008.2003303openalex-snapshot
Symbolic Compilation of PSL
inferred← citeshttps://doi.org/10.1145/3286976openalex-snapshot
From Real-time Logic to Timed Automata
inferred← citeshttps://doi.org/10.1155/2013/462532openalex-snapshot
Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
inferred← citeshttps://doi.org/10.2168/lmcs-2(5:5)2006openalex-snapshot
Linear Encodings of Bounded LTL Model Checking
inferred← citeshttps://doi.org/10.24963/ijcai.2017/158openalex-snapshot
Model Checking Multi-Agent Systems against LDLK Specifications
inferred← citeshttps://doi.org/10.3929/ethz-a-006183969openalex-snapshot
From temporal logics to automata via alternation elimination
showing the first 20 of 21 · page through all 21
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.