scientific article; zbMATH DE number 3800906
From MaRDI portal
Publication:4745241
Cited in
(16)- Real-time refinement in Manna and Pnueli's temporal logic
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Verification of multiprocess probabilistic protocols
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- A structured temporal logic language: XYZ/SE
- A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time
- A temporal logic approach to discrete event control for the safety canonical class
- Proving entailment between conceptual state specifications
- The temporal boolean derivative applied to verification of extended finite state machines
- Decidability for a temporal logic used in discrete-event system analysis
- On the strength of temporal proofs
- Transformation of programs for fault-tolerance
- A principle for sequential reasoning about distributed algorithms
- On using temporal logic for refinement and compositional verification of concurrent systems
- Completing the temporal picture
- The power of temporal proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745241)