On the public citation graph
LTLf Synthesis on Probabilistic Systems
0 signed · 33 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/3-540-45657-0_17openalex-snapshot
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
inferredcites →https://doi.org/10.1007/3-540-60630-0_5openalex-snapshot
Mona: Monadic second-order logic in practice
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-3-030-25543-5_1openalex-snapshot
Satisfiability Checking for Mission-Time LTL
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_31openalex-snapshot
The Hanoi Omega-Automata Format
inferredcites →https://doi.org/10.1007/978-3-319-45856-4openalex-snapshot
Scalable Uncertainty Management
inferredcites →https://doi.org/10.1007/978-3-319-46520-3_9openalex-snapshot
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
inferredcites →https://doi.org/10.1109/icra.2019.8794170openalex-snapshot
Efficient Symbolic Reactive Synthesis for Finite-Horizon Tasks
inferredcites →https://doi.org/10.1109/iros.2017.8206426openalex-snapshot
Reactive synthesis for finite tasks under resource constraints
inferredcites →https://doi.org/10.1109/lra.2018.2889191openalex-snapshot
Automated Abstraction of Manipulation Domains for Cost-Based Reactive Synthesis
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferredcites →https://doi.org/10.1613/jair.1676openalex-snapshot
Decision-Theoretic Planning with non-Markovian Rewards
inferredcites →https://doi.org/10.24963/ijcai.2019/777openalex-snapshot
Partitioning Techniques in LTLf Synthesis
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-3-030-88885-5_1openalex-snapshot
Linear Temporal Logic – From Infinite to Finite Horizon
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_21openalex-snapshot
Policy Synthesis and Reinforcement Learning for Discounted LTL
inferred← citeshttps://doi.org/10.1007/978-3-031-45329-8_11openalex-snapshot
Model Checking Strategies from Synthesis over Finite Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-56940-1_17openalex-snapshot
Composition of Stochastic Services for LTL$$_f$$ Goal Specifications
inferred← citeshttps://doi.org/10.1007/s10514-023-10145-1openalex-snapshot
SpaTiaL: monitoring and planning of robotic tasks using spatio-temporal logic specifications
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683557openalex-snapshot
Synergistic Offline-Online Control Synthesis via Local Gaussian Process Regression
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9812273openalex-snapshot
Failure is an option: Task and Motion Planning with Failing Executions
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561297openalex-snapshot
Finite-Horizon Synthesis for Probabilistic Manipulation Domains
inferred← citeshttps://doi.org/10.1109/icra48891.2023.10160897openalex-snapshot
Planning with SiMBA: Motion Planning under Uncertainty for Temporal Goals using Simplified Belief Guides
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10611623openalex-snapshot
Stochastic Games for Interactive Manipulation Domains
inferred← citeshttps://doi.org/10.1109/lcsys.2022.3178143openalex-snapshot
Formal Control Synthesis for Stochastic Neural Network Dynamic Models
inferred← citeshttps://doi.org/10.1109/ojcsys.2023.3294829openalex-snapshot
Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems
inferred← citeshttps://doi.org/10.1109/tac.2024.3459308openalex-snapshot
Bayesian Formal Synthesis of Unknown Systems via Robust Simulation Relations
inferred← citeshttps://doi.org/10.1109/tmrb.2023.3261342openalex-snapshot
A Survey on Technical Challenges of Assistive Robotics for Elder People in Domestic Environments: The ASPiDA Concept
inferred← citeshttps://doi.org/10.1109/tro.2026.3663976openalex-snapshot
Formal Specification and Control Synthesis of Autonomous Robots Using Rulebooks
inferred← citeshttps://doi.org/10.1587/transinf.2021fop0003openalex-snapshot
Finite-Horizon Optimal Spatio-Temporal Pattern Control under Spatio-Temporal Logic Specifications
inferred← citeshttps://doi.org/10.4204/eptcs.346.8openalex-snapshot
On the Power of Automata Minimization in Reactive Synthesis
inferred← citeshttps://doi.org/10.48130/ker-0026-0003openalex-snapshot
Stochastic service composition for ʟᴛʟf reachability and safety tasks
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.