On the public citation graph

Checking linear duration invariants by linear programming

https://doi.org/10.1007/bfb0027804
0 signed · 38 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-57318-6_29openalex-snapshot
Integration Graphs: A class of decidable hybrid systems
inferredcites →https://doi.org/10.1007/3-540-58468-4_161openalex-snapshot
Linear duration invariants
inferredcites →https://doi.org/10.1007/3-540-58468-4_189openalex-snapshot
Towards a duration calculus proof assistant in PVS
inferredcites →https://doi.org/10.1007/bf01213605openalex-snapshot
Model-checking discrete duration calculus
inferredcites →https://doi.org/10.1007/bfb0027804openalex-snapshot
Checking linear duration invariants by linear programming
inferredcites →https://doi.org/10.1016/0020-0190(91)90122-xopenalex-snapshot
A calculus of durations
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-46674-6_13openalex-snapshot
Completeness and Decidability of a Fragment of Duration Calculus with Iteration
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_47openalex-snapshot
Representation of discretely controlled continuous systems in software-oriented formal analysis
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_51openalex-snapshot
Checking hybrid automata for linear duration invariants
inferred← citeshttps://doi.org/10.1007/3-540-64358-3_53openalex-snapshot
Hybrid regular expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_22openalex-snapshot
Verifying Linear Duration Constraints of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_6openalex-snapshot
Real-Time Systems Development with Duration Calculi: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-540-74107-7_6openalex-snapshot
Duration Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74964-6_3openalex-snapshot
A Theory of Duration Calculus with Application
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_27openalex-snapshot
Verification of Linear Duration Invariants by Model Checking CTL Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_14openalex-snapshot
Model Checking Linear Duration Invariants of Networks of Automata
inferred← citeshttps://doi.org/10.1007/bf01211086openalex-snapshot
Duration calculus: Logical foundations
inferred← citeshttps://doi.org/10.1007/bf02950405openalex-snapshot
Checking timed automata for linear duration properties
inferred← citeshttps://doi.org/10.1007/bf02960759openalex-snapshot
Checking Temporal Duration Properties of timed automata
inferred← citeshttps://doi.org/10.1007/bfb0055351openalex-snapshot
On checking parallel real-time systems for linear duration properties
inferred← citeshttps://doi.org/10.1007/s00165-004-0033-xopenalex-snapshot
Duration-constrained regular expressions
inferred← citeshttps://doi.org/10.1007/s11704-013-2195-2openalex-snapshot
A survey on temporal logics for specifying and verifying real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.088openalex-snapshot
On Verification of Linear Occurrence Properties of Real-Time Systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.017openalex-snapshot
On the completeness and decidability of duration calculus with iteration
inferred← citeshttps://doi.org/10.1109/iwssd.2000.891126openalex-snapshot
Duration properties over real time system designs
inferred← citeshttps://doi.org/10.1109/pdse.1998.668157openalex-snapshot
On checking parallel real-time systems for linear duration invariants
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796568openalex-snapshot
Checking time Petri nets for linear duration properties
inferred← citeshttps://doi.org/10.1109/real.1998.739752openalex-snapshot
On checking timed automata for linear duration invariants
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.53openalex-snapshot
On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties
inferred← citeshttps://doi.org/10.1145/2461328.2461362openalex-snapshot
Bounded model-checking of discrete duration calculus
inferred← citeshttps://doi.org/10.1145/3178126.3178147openalex-snapshot
Model Checking Bounded Continuous-time Extended Linear Duration Invariants
inferred← citeshttps://doi.org/10.48550/arxiv.1005.3199openalex-snapshot
A Survey on Temporal Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1005.3200openalex-snapshot
Real-time and Probabilistic Temporal Logics: An Overview
inferred← citeshttps://doi.org/10.5555/857171.857225openalex-snapshot
Duration Properties over Real Time System Designs
inferred← citeshttps://doi.org/10.55630/sjc.2013.7.1-12openalex-snapshot
Approximate Model Checking of Real-Time Systems for Linear Duration Invariants
showing the first 29 of 30 · page through all 30
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.