Alternating-time temporal logic
From MaRDI portal
Cites work
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Alternation
- Automata-theoretic techniques for modal logics of programs
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Liveness in timed and untimed systems
- Number of quantifiers is better than number of tape cells
- On the synthesis of strategies in infinite games
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
- The complexity of two-player games of incomplete information
- “Sometimes” and “not never” revisited
Cited in
(4)
This page was built for publication: Alternating-time temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010082)