The following pages link to A calculus of durations (Q1183485):
Displaying 50 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- A novel algorithm for intrusion detection based on RASL model checking (Q474447) (← links)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- On the completeness and decidability of duration calculus with iteration (Q557828) (← links)
- A generic logical-temporal performance analysis method for complex systems (Q622209) (← links)
- Mathematical analysis of stage-based programmable logic controller (Q636562) (← links)
- Interval logics and their decision procedures. II: A real-time interval logic (Q672040) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- Finite divergence (Q673876) (← links)
- Metric temporal logic with durations (Q673880) (← links)
- Sequential calculus (Q674261) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Algebraic neighbourhood logic (Q929966) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- A timeband framework for modelling real-time systems (Q987537) (← links)
- Rate monotonic scheduling re-analysed (Q991759) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- A formal framework for modeling and validating simulink diagrams (Q1037245) (← links)
- Non-elementary lower bound for Propositional Duration Calculus (Q1129106) (← links)
- Design for delay verifiability (Q1288419) (← links)
- Decidability of mean value calculus (Q1288439) (← links)
- Models for reactivity (Q1323323) (← links)
- Extending Hoare logic to real-time (Q1346769) (← links)
- Model-checking discrete duration calculus (Q1346770) (← links)
- Duration calculus: Logical foundations (Q1377324) (← links)
- Completeness of the accumulation calculus (Q1383468) (← links)
- Induction in the timed interval calculus (Q1399964) (← links)
- Automata over continuous time (Q1399970) (← links)
- Completeness of temporal logics over infinite intervals. (Q1421487) (← links)
- Verification of duration systems using an approximation approach (Q1429422) (← links)
- Specification and verification of multimedia synchronization in duration calculus (Q1429426) (← links)
- Checking temporal duration properties of timed automata. (Q1433946) (← links)
- Star free expressions over the reals (Q1575940) (← links)
- Refinement of time (Q1589580) (← links)
- Deductive verification of real-time systems using STeP (Q1589585) (← links)
- PLC-automata: A new class of implementable real-time automata (Q1589587) (← links)
- Verification, refinement and scheduling of real-time programs (Q1589590) (← links)
- Efficient verification of a class of time Petri nets using linear programming (Q1603403) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- An abstract model for proving safety of autonomous urban traffic (Q1786569) (← links)
- BDI-modelling of complex intracellular dynamics (Q1788608) (← links)
- Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) (← links)
- Decidable integration graphs. (Q1854273) (← links)
- Expressive completeness of duration calculus. (Q1854330) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
