A logic for application level QoS
From MaRDI portal
Cites work
- A formal basis for reasoning on programmable QoS
- A lattice-theoretical fixpoint theorem and its applications
- A spatial logic for concurrency. I
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 1670788 (Why is no real title available?)
- scientific article; zbMATH DE number 3819108 (Why is no real title available?)
- scientific article; zbMATH DE number 1956515 (Why is no real title available?)
- scientific article; zbMATH DE number 1927564 (Why is no real title available?)
- scientific article; zbMATH DE number 2086655 (Why is no real title available?)
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
- Semiring-based constraint satisfaction and optimization
- Synchronization algebras with mobility for graph transformations
- Verifying a behavioural logic for graph transformation systems
Cited in
(1)
This page was built for publication: A logic for application level QoS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014290)