On the public citation graph

Verifying Quantitative Properties Using Bound Functions

https://doi.org/10.1007/11560548_7
0 signed · 52 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-36078-6_20openalex-snapshot
Games, Probability, and the Quantitative μ-Calculus qMμ
inferredcites →https://doi.org/10.1007/3-540-44612-5openalex-snapshot
Mathematical foundations of computer science 2000 : 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings
inferredcites →https://doi.org/10.1007/3-540-44612-5_38openalex-snapshot
Counter Machines: Decidable Properties and Applications to Verification Problems
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-60692-0_70openalex-snapshot
Model checking of probabilistic and nondeterministic systems
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_8openalex-snapshot
Dense Counter Machines and Verification Problems
inferredcites →https://doi.org/10.1007/978-3-540-45212-6_9openalex-snapshot
Resource Interfaces
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
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/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/j.jcss.2003.07.009openalex-snapshot
Quantitative solution of omega-regular games
inferredcites →https://doi.org/10.1016/s0890-5401(03)00038-5openalex-snapshot
An algebraic approach to data languages and timed languages
inferredcites →https://doi.org/10.1109/lics.1997.614940openalex-snapshot
Quantitative analysis and model checking
inferredcites →https://doi.org/10.1109/lics.2001.932504openalex-snapshot
From verification to control: dynamic programs for omega-regular objectives
inferredcites →https://doi.org/10.1145/585265.585270openalex-snapshot
Alternating-time temporal logic
inferredcites →https://doi.org/10.1145/73560.73582openalex-snapshot
A temporal fixpoint calculus
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems

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-25540-4_4openalex-snapshot
Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_18openalex-snapshot
Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_2openalex-snapshot
Quantitative Generalizations of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_28openalex-snapshot
Quantitative Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_14openalex-snapshot
Better Quality in Synthesis through Quantitative Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_17openalex-snapshot
Probabilistic Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_16openalex-snapshot
Rational Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_34openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_28openalex-snapshot
Coping with Selfish On-Going Behaviors
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_16openalex-snapshot
Formal Analysis of Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_8openalex-snapshot
Recent Challenges and Ideas in Temporal Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_8openalex-snapshot
Compositional Branching-Time Measurements
inferred← citeshttps://doi.org/10.1016/j.ic.2011.10.009openalex-snapshot
Coping with selfish on-going behaviors
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.005openalex-snapshot
Rigorous approximated determinization of weighted automata
inferred← citeshttps://doi.org/10.1109/iros.2017.8206426openalex-snapshot
Reactive synthesis for finite tasks under resource constraints
inferred← citeshttps://doi.org/10.1109/lics.2009.16openalex-snapshot
Expressiveness and Closure Properties for Quantitative Languages
inferred← citeshttps://doi.org/10.1109/lics.2011.50openalex-snapshot
Rigorous Approximated Determinization of Weighted Automata
inferred← citeshttps://doi.org/10.1109/rtas.2008.9openalex-snapshot
Schedulability Analysis of MSC-based System Models
inferred← citeshttps://doi.org/10.1145/1721837.1721844openalex-snapshot
Reasoning about online algorithms with weighted automata
inferred← citeshttps://doi.org/10.1145/1805950.1805953openalex-snapshot
Quantitative languages
inferred← citeshttps://doi.org/10.1145/1883612.1883614openalex-snapshot
One step forward
inferred← citeshttps://doi.org/10.1145/2331147.2331165openalex-snapshot
Quantitative Analysis of Systems Using Game-Theoretic Learning
inferred← citeshttps://doi.org/10.1145/2699430openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.21236/ada538736openalex-snapshot
Quantitative Analysis of Embedded Software Using Game-Theoretic Learning
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:10)2010openalex-snapshot
Expressiveness and Closure Properties for Quantitative Languages
inferred← citeshttps://doi.org/10.4204/eptcs.50.2openalex-snapshot
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2638openalex-snapshot
Better Quality in Synthesis through Quantitative Objectives
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0739openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.2010.02055openalex-snapshot
Automata-based Quantitative Verification
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05027openalex-snapshot
A translation of weighted LTL formulas to weighted Büchi automata over ω-valuation monoids
inferred← citeshttps://doi.org/10.5555/1496770.1496861openalex-snapshot
Reasoning about online algorithms with weighted automata
inferred← citeshttps://doi.org/10.70675/9ec2dc59zadb1z414fz949fz0fd1afaab001openalex-snapshot
Specification and verification of quantitative properties : expressions, logics, and automata
inferred← citeshttps://doi.org/10.7561/sacs.2021.2.223openalex-snapshot
A Translation of Weighted LTL Formulas to Weighted Buchi Automata over 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.