On the public citation graph
Formally Reasoning About Quality
0 signed · 113 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.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/11817949_3openalex-snapshot
Sanity Checks in Formal Verification
inferredcites →https://doi.org/10.1007/3-540-44585-4_6openalex-snapshot
Fast LTL to Büchi Automata Translation
inferredcites →https://doi.org/10.1007/3-540-45061-0_79openalex-snapshot
Discounting the Future in Systems Theory
inferredcites →https://doi.org/10.1007/3-540-55719-9_67openalex-snapshot
The equality problem for rational series with multiplicities in the tropical semiring is undecidable
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/978-3-319-48989-6_35openalex-snapshot
Discounted Duration Calculus
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_11openalex-snapshot
Linear and Branching Metrics for Quantitative Transition Systems
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_26openalex-snapshot
Model Checking with Multi-valued Logics
inferredcites →https://doi.org/10.1007/978-3-642-01492-5openalex-snapshot
Handbook of Weighted Automata
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_14openalex-snapshot
Better Quality in Synthesis through Quantitative Objectives
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_7openalex-snapshot
Alternation Removal in Büchi Automata
inferredcites →https://doi.org/10.1007/978-3-642-15297-9_9openalex-snapshot
Robust Satisfaction of Temporal Logic over Real-Valued Signals
inferredcites →https://doi.org/10.1007/978-3-642-15643-4_4openalex-snapshot
Promptness in ω-Regular Automata
inferredcites →https://doi.org/10.1007/978-3-642-24372-1_2openalex-snapshot
Max and Sum Semantics for Alternating Weighted Automata
inferredcites →https://doi.org/10.1007/978-3-642-24372-1_37openalex-snapshot
What’s Decidable about Weighted Automata?
inferredcites →https://doi.org/10.1007/978-3-642-31606-7_32openalex-snapshot
Weighted LTL with Discounting
inferredcites →https://doi.org/10.1007/978-3-642-33386-6_9openalex-snapshot
On Temporal Logic and Signal Processing
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_12openalex-snapshot
Synthesis from LTL Specifications with Mean-Payoff Objectives
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_3openalex-snapshot
Formalizing and Reasoning about Quality
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_32openalex-snapshot
Automatic Generation of Quality Specifications
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_17openalex-snapshot
Multi-objective Discounted Reward Verification in Graphs and MDPs
inferredcites →https://doi.org/10.1007/978-94-015-9586-5_6openalex-snapshot
Synthesis with Incomplete Informatio
inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferredcites →https://doi.org/10.1007/s10703-009-0067-zopenalex-snapshot
From liveness to promptness
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(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/j.entcs.2008.11.019openalex-snapshot
Model Checking Quantitative Linear Time Logic
inferredcites →https://doi.org/10.1016/j.tcs.2003.09.013openalex-snapshot
Metrics for labelled Markov processes
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.033openalex-snapshot
Model checking discounted temporal properties
inferredcites →https://doi.org/10.1016/j.tcs.2009.03.029openalex-snapshot
Weighted automata and weighted logics with discounting
inferredcites →https://doi.org/10.1016/j.tcs.2011.11.008openalex-snapshot
Weighted automata and multi-valued logics over arbitrary bounded lattices
inferredcites →https://doi.org/10.1038/scientificamerican05161874-308openalex-snapshot
Proceedings of the National Academy of Science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2015.74openalex-snapshot
The Target Discounted-Sum Problem
inferredcites →https://doi.org/10.1109/tsmcb.2003.819485openalex-snapshot
Fuzzy Branching Temporal Logic
inferredcites →https://doi.org/10.1137/070697926openalex-snapshot
On the Complexity of Numerical Analysis
inferredcites →https://doi.org/10.1142/s0218196794000063openalex-snapshot
THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
inferredcites →https://doi.org/10.1145/2629686openalex-snapshot
Temporal Specifications with Accumulative Values
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.3233/fun-2008-843-402openalex-snapshot
Multi-Valued MSO Logics OverWords and Trees
inferredcites →https://doi.org/10.4230/lipics.csl.2016.28openalex-snapshot
High-Quality Synthesis Against Stochastic Environments
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2014.133openalex-snapshot
Finite-Valued Weighted Automata
inferredcites →https://doi.org/10.4230/lipics.stacs.2009.1850openalex-snapshot
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.5555/972695.972698openalex-snapshot
Finite-state transducers in language and speech processing
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-01090-4_27openalex-snapshot
Maximum Realizability for Linear Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_3openalex-snapshot
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
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-030-89716-1_1openalex-snapshot
Quantitative vs. Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_3openalex-snapshot
Synthesis of Compact Strategies for Coordination Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-27901-0_6openalex-snapshot
Formal Modeling, Verification and Automated Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_54openalex-snapshot
Robust Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-45329-8_16openalex-snapshot
Compositional High-Quality Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-77367-9_18openalex-snapshot
Theory and Practice of Quantitative ATL
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_6openalex-snapshot
Games with Weighted Multiple Objectives
inferred← citeshttps://doi.org/10.1007/978-3-032-22820-8_2openalex-snapshot
Equilibrium Synthesis for Generalised Dining Philosophers Games
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_1openalex-snapshot
On High-Quality Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_19openalex-snapshot
Quantitative Assume Guarantee Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_15openalex-snapshot
Latticed-LTL Synthesis in the Presence of Noisy Inputs
inferred← citeshttps://doi.org/10.1007/s00236-019-00348-4openalex-snapshot
Reactive synthesis with maximum realizability of linear temporal logic specifications
inferred← citeshttps://doi.org/10.1007/s10626-017-0242-0openalex-snapshot
Latticed-LTL synthesis in the presence of noisy inputs
inferred← citeshttps://doi.org/10.1007/s10817-025-09737-6openalex-snapshot
LTL Reactive Synthesis with a Few Hints
inferred← citeshttps://doi.org/10.1007/s11334-024-00552-7openalex-snapshot
Robust computation tree logic
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104236openalex-snapshot
Gödel–Dummett linear temporal logic
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104272openalex-snapshot
Formal verification and synthesis of mechanisms for social choice
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.024openalex-snapshot
Extending finite-memory determinacy to multi-player games
inferred← citeshttps://doi.org/10.1016/j.is.2023.102312openalex-snapshot
Measuring rule-based LTLf process specifications: A probabilistic data-driven approach
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.001openalex-snapshot
Model checking and synthesis for branching multi-weighted logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.001openalex-snapshot
Synthesis from component libraries with costs
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619233openalex-snapshot
Directed Control of Discrete Event Systems with $\mathbf{LTL} [\mathcal{F}]$ Specifications
inferred← citeshttps://doi.org/10.1109/icpm57379.2022.9980690openalex-snapshot
Measurement of Rule-based LTLf Declarative Process Specifications
inferred← citeshttps://doi.org/10.1109/icrito.2018.8748750openalex-snapshot
An Overview on Formal Techniques for Understanding Digital Hardware Designs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470616openalex-snapshot
Perspective Multi-Player Games
inferred← citeshttps://doi.org/10.1109/tac.2021.3139221openalex-snapshot
Finite-Memory Supervisory Control of Discrete Event Systems for LTL[$\mathcal {F}$] Specifications
inferred← citeshttps://doi.org/10.1109/tfuzz.2020.2988848openalex-snapshot
Possibilistic Fuzzy Linear Temporal Logic and Its Model Checking
inferred← citeshttps://doi.org/10.1145/2968478.2968499openalex-snapshot
Synthesizing time-triggered schedules for switched networks with faulty links
inferred← citeshttps://doi.org/10.1145/3121408openalex-snapshot
The Complexity of Mean-Payoff Pushdown Games
inferred← citeshttps://doi.org/10.1145/3491216openalex-snapshot
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic
inferred← citeshttps://doi.org/10.1145/3582498openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviors
inferred← citeshttps://doi.org/10.1145/3812533openalex-snapshot
OLTL: An Optimization Extension of Linear Temporal Logic
inferred← citeshttps://doi.org/10.1561/2600000029openalex-snapshot
Formal Methods for Autonomous Systems
inferred← citeshttps://doi.org/10.2139/ssrn.6044967openalex-snapshot
Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
inferred← citeshttps://doi.org/10.24963/ijcai.2018/848openalex-snapshot
SynKit: LTL Synthesis as a Service
inferred← citeshttps://doi.org/10.24963/ijcai.2019/220openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviours
inferred← citeshttps://doi.org/10.24963/ijcai.2022/361openalex-snapshot
LTL on Weighted Finite Traces: Formal Foundations and Algorithms
inferred← citeshttps://doi.org/10.24963/kr.2021/46openalex-snapshot
Strategic Reasoning in Automated Mechanism Design
inferred← citeshttps://doi.org/10.3233/faia200437openalex-snapshot
Reasoning About Quality and Fuzziness of Strategic Behaviours
inferred← citeshttps://doi.org/10.3390/axioms13120832openalex-snapshot
Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking
inferred← citeshttps://doi.org/10.3390/math12193148openalex-snapshot
Fuzzy Linear Temporal Logic with Quality Constraints
inferred← citeshttps://doi.org/10.4204/eptcs.218.3openalex-snapshot
Extending Finite Memory Determinacy to Multiplayer Games
inferred← citeshttps://doi.org/10.7561/sacs.2023.2.93openalex-snapshot
Describing Weighted Safety with Weighted LTL over Product omega-valuation Monoids
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.