The following pages link to CONCUR 2003 - Concurrency Theory (Q5900571):
Displayed 13 items.
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- Multi-valued model checking games (Q414899) (← links)
- Model checking fuzzy computation tree logic (Q529056) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Data structures for symbolic multi-valued model-checking (Q862857) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Co-Algebraic Models for Quantitative Spatial Logics (Q2870283) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Bonsai: Cutting Models Down to Size (Q3455087) (← links)
- A Weighted μ-Calculus on Words (Q3637241) (← links)
- Multi-valued Verification of Strategic Ability (Q4988961) (← links)
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design (Q5039527) (← links)