Forward and backward simulations. II: Timing-based systems
From MaRDI portal
Recommendations
Cited in
(28)- Towards a real-time distributed computing model
- Using mappings to prove timing properties
- Liveness in timed and untimed systems
- What's decidable about hybrid automata?
- Eventually-serializable data services
- A process algebra of communicating shared resources with dense time and priorities
- Hybrid I/O automata.
- Revisiting the PAXOS algorithm
- Refinement of time
- Action transducers and timed automata
- Trade-off results for connection management
- Iterating transducers
- Forward and backward simulations. I. Untimed Systems
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Reversibility in the higher-order \(\pi\)-calculus
- A proof-based method for modelling timed systems
- scientific article; zbMATH DE number 1512619 (Why is no real title available?)
- Oritatami System; a Survey and the Impossibility of Simple Simulation at Small Delays
- Liveness in timed and untimed systems
- An automatic technique for checking the simulation of timed systems
- A menagerie of timed automata
- Generic Forward and Backward Simulations
- Weak bisimulation for probabilistic timed automata
- A basic compositional model for spiking neural networks
- On specifications and proofs of timed circuits
- The HOL-CSP Refinement Toolkit
- HOL-CSP Version 2.0
- A Sound Type System for Physical Quantities, Units, and Measurements
This page was built for publication: Forward and backward simulations. II: Timing-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923088)
