On the public citation graph

Temporal Specifications with Accumulative Values

0 signed · 85 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.1006/inco.1993.1006openalex-snapshot
Reasoning in a Restricted Temporal Logic
inferredcites →https://doi.org/10.1007/3-540-09510-1_31openalex-snapshot
The modal logic of programs
inferredcites →https://doi.org/10.1007/3-540-45061-0_35openalex-snapshot
Skew and Infinitary Formal Power Series
inferredcites →https://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferredcites →https://doi.org/10.1007/3-540-63166-6_39openalex-snapshot
Symbolic model checking of infinite state systems using presburger arithmetic
inferredcites →https://doi.org/10.1007/3-540-65306-6_20openalex-snapshot
Decidability and complexity of Petri net problems — An introduction
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_94openalex-snapshot
Counting in Trees for Free
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_50openalex-snapshot
An Algebraic Generalization of ω-Regular Languages
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_52openalex-snapshot
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
inferredcites →https://doi.org/10.1007/978-3-540-45187-7_18openalex-snapshot
Multi-valued Model Checking via Classical Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-69738-1_14openalex-snapshot
Lattice Automata
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_28openalex-snapshot
Quantitative Languages
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_24openalex-snapshot
On Omega-Languages Defined by Mean-Payoff Conditions
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-12032-9_13openalex-snapshot
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
inferredcites →https://doi.org/10.1007/978-3-642-15155-2_47openalex-snapshot
Describing Average- and Longtime-Behavior by Weighted MSO Logics
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_19openalex-snapshot
Church Synthesis Problem for Noisy Input
inferredcites →https://doi.org/10.1007/978-3-642-28729-9_27openalex-snapshot
Branching-Time Model Checking of Parametric One-Counter Automata
inferredcites →https://doi.org/10.1007/978-3-642-31585-5_36openalex-snapshot
The Complexity of Mean-Payoff Automaton Expression
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot
Super-Exponential Complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/bfb0028774openalex-snapshot
MOCHA: Modularity in model checking
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/0022-0000(78)90021-1openalex-snapshot
A 222pn upper bound on the complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(95)00188-3openalex-snapshot
The complexity of mean payoff games on graphs
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.2007.02.055openalex-snapshot
Weighted automata and weighted logics
inferredcites →https://doi.org/10.1016/j.tcs.2012.07.038openalex-snapshot
Energy parity games
inferredcites →https://doi.org/10.1016/s0019-9958(61)80020-xopenalex-snapshot
On the definition of a family of automata
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2006.34openalex-snapshot
Memoryful Branching-Time Logic
inferredcites →https://doi.org/10.1109/lics.2011.33openalex-snapshot
Temporal Specifications with Accumulative Values
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1137/0205045openalex-snapshot
Simple Programs Realize Exactly Presburger Formulas
inferredcites →https://doi.org/10.1137/s0097539791224893openalex-snapshot
Finite Automata Computing Real Functions
inferredcites →https://doi.org/10.1145/174644.174651openalex-snapshot
A really temporal logic
inferredcites →https://doi.org/10.1145/3149.3157openalex-snapshot
Decidable problems for powerful programs
inferredcites →https://doi.org/10.1145/321356.321364openalex-snapshot
On Context-Free Languages
inferredcites →https://doi.org/10.1145/567067.567081openalex-snapshot
"Sometimes" and "not never" revisited
inferredcites →https://doi.org/10.1145/62212.62251openalex-snapshot
Detecting cycles in dynamic graphs in polynomial time
inferredcites →https://doi.org/10.1145/800133.804361openalex-snapshot
Presburger arithmetic with bounded quantifier alternation
inferredcites →https://doi.org/10.1145/800135.804407openalex-snapshot
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
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.fsttcs.2010.505openalex-snapshot
Generalized Mean-payoff and Energy Games

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-17465-1_21openalex-snapshot
Measuring Masking Fault-Tolerance
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-71995-1_5openalex-snapshot
“Most of” leads to undecidability: Failure of adding frequencies to LTL
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-031-30829-1_17openalex-snapshot
Quantitative Safety and Liveness
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_1openalex-snapshot
Introduction to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot
The 10,000 Facets of MDP Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_29openalex-snapshot
A Counting Semantics for Monitoring LTL Specifications over Finite Traces
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_2openalex-snapshot
Quantitative Monitor Automata
inferred← citeshttps://doi.org/10.1007/s10458-024-09648-7openalex-snapshot
Controller synthesis for linear temporal logic and steady-state specifications
inferred← citeshttps://doi.org/10.1007/s10472-022-09804-3openalex-snapshot
On the complexity of rational verification
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.006openalex-snapshot
Quantitative fair simulation games
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104651openalex-snapshot
What's decidable about weighted automata?
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.04.005openalex-snapshot
Hyperplane separation technique for multidimensional mean-payoff games
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.1109/lics.2017.8005090openalex-snapshot
Computing quantiles in Markov chains with multi-dimensional costs
inferred← citeshttps://doi.org/10.1109/tac.2023.3342880openalex-snapshot
Optimal Synthesis of Opacity-Enforcing Supervisors for Qualitative and Quantitative Specifications
inferred← citeshttps://doi.org/10.1109/tase.2012.9openalex-snapshot
A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata
inferred← citeshttps://doi.org/10.1145/2875421openalex-snapshot
Formally Reasoning About Quality
inferred← citeshttps://doi.org/10.1145/2883817.2883839openalex-snapshot
Temporal Logic as Filtering
inferred← citeshttps://doi.org/10.1145/2933575.2933588openalex-snapshot
Quantitative Automata under Probabilistic Semantics
inferred← citeshttps://doi.org/10.1145/2934466.2934473openalex-snapshot
Long-term average cost in featured transition systems
inferred← citeshttps://doi.org/10.1145/3152769openalex-snapshot
Nested Weighted Automata
inferred← citeshttps://doi.org/10.1145/3178126.3178139openalex-snapshot
Bisimulations, logics, and trace distributions for stochastic systems with rewards
inferred← citeshttps://doi.org/10.1145/3365365.3382203openalex-snapshot
A deontic logic analysis of autonomous systems' safety
inferred← citeshttps://doi.org/10.1145/3460975openalex-snapshot
Algorithmic Ethics: Formalization and Verification of Autonomous Vehicle Obligations
inferred← citeshttps://doi.org/10.1145/3582498openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviors
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:16)2019openalex-snapshot
Quantitative Automata under Probabilistic Semantics
inferred← citeshttps://doi.org/10.24963/ijcai.2019/47openalex-snapshot
On Computational Tractability for Rational Verification
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cbeopenalex-snapshot
"Most of"' leads to undecidability: Failure of adding frequencies to LTL
inferred← citeshttps://doi.org/10.3233/faia200437openalex-snapshot
Reasoning About Quality and Fuzziness of Strategic Behaviours
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.69openalex-snapshot
Weighted Strategy Logic with Boolean Goals Over One-Counter Games
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:21)2024openalex-snapshot
Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
inferred← citeshttps://doi.org/10.46298/lmcs-21(2:18)2025openalex-snapshot
Discounted-Sum Automata with Multiple Discount Factors
inferred← citeshttps://doi.org/10.5555/2337223.2337341openalex-snapshot
Specification patterns from research to industry: a case study in service-based applications
inferred← citeshttps://doi.org/10.65109/yjhm3601openalex-snapshot
Controller Synthesis for Omega-Regular and Steady-State Specifications
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.