On the public citation graph

Model-checking discrete duration calculus

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-52559-9_61openalex-snapshot

Refinement calculus, part II: Parallel and reactive programs

inferredcites →https://doi.org/10.1007/3-540-56503-5_8openalex-snapshot

Decidability and undecidability results for duration calculus

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-57318-6_30openalex-snapshot

Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems

inferredcites →https://doi.org/10.1007/3-540-57318-6_40openalex-snapshot

A formal approach to computer systems requirements documentation

inferredcites →https://doi.org/10.1007/3-540-57529-4_52openalex-snapshot

A real-time interval logic and its decision procedure

inferredcites →https://doi.org/10.1007/3-540-58468-4_166openalex-snapshot

Verifying invariance properties of timed systems with duration variables

inferredcites →https://doi.org/10.1007/bf01178579openalex-snapshot

From ATP to timed graphs and hybrid systems

inferredcites →https://doi.org/10.1007/bf01995674openalex-snapshot

Specifying real-time properties with metric temporal logic

inferredcites →https://doi.org/10.1007/bfb0031987openalex-snapshot

The theory of timed automata

inferredcites →https://doi.org/10.1007/bfb0031994openalex-snapshot

Semantics and completeness of Duration Calculus

inferredcites →https://doi.org/10.1007/bfb0032007openalex-snapshot

From ATP to timed graphs and hybrid systems

inferredcites →https://doi.org/10.1007/bfb0036915openalex-snapshot

A hardware semantics based on temporal intervals

inferredcites →https://doi.org/10.1016/0020-0190(91)90122-xopenalex-snapshot

A calculus of durations

inferredcites →https://doi.org/10.1017/cbo9780511526589openalex-snapshot

Nets, Terms and Formulas

inferredcites →https://doi.org/10.1109/32.210306openalex-snapshot

Specifying and verifying requirements of real-time systems

inferredcites →https://doi.org/10.1109/emwrt.1992.637481openalex-snapshot

Specification Of Embedded, Real-time Systems

inferredcites →https://doi.org/10.1109/emwrt.1993.639088openalex-snapshot

Developing Correct Systems

inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot

Model-checking for real-time systems

inferredcites →https://doi.org/10.1109/lics.1993.287592openalex-snapshot

On model checking for real-time properties with durations

inferredcites →https://doi.org/10.1109/mc.1985.1662795openalex-snapshot

A Temporal Logic for Multilevel Reasoning about Hardware

inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot

Automatic verification of finite-state concurrent systems using temporal logic specifications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11560647_17openalex-snapshot

A Robust Interpretation of Duration Calculus

inferred← citeshttps://doi.org/10.1007/11590156_36openalex-snapshot

Modal Strength Reduction in Quantified Discrete Duration Calculus

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_16openalex-snapshot

Take It NP-Easy: Bounded Model Construction for Duration Calculus

inferred← citeshttps://doi.org/10.1007/3-540-60249-6_39openalex-snapshot

A duration calculus with infinite intervals

inferred← citeshttps://doi.org/10.1007/3-540-60630-0_9openalex-snapshot

Analytic and locally approximate solutions to properties of probabilistic processes

inferred← citeshttps://doi.org/10.1007/3-540-61648-9_40openalex-snapshot

Synthesizing controllers from Duration Calculus

inferred← citeshttps://doi.org/10.1007/3-540-61648-9_41openalex-snapshot

Sampling semantics of Duration Calculus

inferred← citeshttps://doi.org/10.1007/978-1-4615-5123-2_7openalex-snapshot

Interval Temporal Logic

inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot

Tools and Algorithms for the Construction and Analysis of Systems

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/bf01211086openalex-snapshot

Duration calculus: Logical foundations

inferred← citeshttps://doi.org/10.1007/bfb0027804openalex-snapshot

Checking linear duration invariants by linear programming

inferred← citeshttps://doi.org/10.1007/bfb0035395openalex-snapshot

Compositional performance analysis

inferred← citeshttps://doi.org/10.1007/s10472-013-9373-7openalex-snapshot

A practical approach to model checking Duration Calculus using Presburger Arithmetic

inferred← citeshttps://doi.org/10.1016/s0928-4869(98)00013-5openalex-snapshot

Exact, analytic, and locally approximate solutions to discrete event-simulation problems

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80480-8openalex-snapshot

Interval Duration Logic

inferred← citeshttps://doi.org/10.1093/comjnl/38.9.734openalex-snapshot

A Case Study of Optimization

inferred← citeshttps://doi.org/10.1109/real.1998.739752openalex-snapshot

On checking timed automata for linear duration invariants

inferred← citeshttps://doi.org/10.1109/sefm.2008.26openalex-snapshot

Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations

inferred← citeshttps://doi.org/10.1109/time.2011.26openalex-snapshot

On Tool Support for Duration Calculus on the Basis of Presburger Arithmetic

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.3166/jancl.14.9-54openalex-snapshot

A Road Map of Interval Temporal Logics and Duration Calculi

inferred← citeshttps://doi.org/10.3233/fi-1998-36236openalex-snapshot

Truth of Duration Calculus Formulae in Timed Frames

inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.193openalex-snapshot

A Model Checking Procedure for Interval Temporal Logics based on Track Representatives

inferred← citeshttps://doi.org/10.48550/arxiv.1005.3199openalex-snapshot

A Survey on Temporal Logics

inferred← citeshttps://doi.org/10.48550/arxiv.1212.3838openalex-snapshot

Towards Approximate Model Checking DC and PDC Specifications

inferred← citeshttps://doi.org/10.55630/sjc.2013.7.1-12openalex-snapshot

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

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.