Min-max Computation Tree Logic

DOI10.1016/S0004-3702(01)00059-5zbMath0976.68104OpenAlexW1966598143WikidataQ128132728 ScholiaQ128132728MaRDI QIDQ5940962

No author found.

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00059-5

zbMATH Keywords

formal verificationmodel checkingtemporal logictiming verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items

Model checking for a class of weighted automata, A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria, Min-max event-triggered computation tree logic, Collecting statistics over runtime executions

Cites Work

• Model-checking in dense real-time
• Real-time logics: Complexity and expressiveness
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• A really temporal logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item