scientific article

zbMath1483.68187arXiv1709.02107MaRDI QIDQ3384177

Laura Bozzelli, Aniello Murano

Publication date: 14 December 2021

Full work available at URL: https://arxiv.org/abs/1709.02107

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (2)

Alternating-time temporal logics with linear past ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmenting ATL with strategy contexts
• Pushdown module checking
• Strategy logic
• Reasoning about infinite computations
• Pushdown module checking with imperfect information
• Quantified CTL: Expressiveness and Complexity
• Reasoning About Strategies
• Alternating-time temporal logic
• ATL* Satisfiability Is 2EXPTIME-Complete
• Enriched MU-Calculi Module Checking
• Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
• “Sometimes” and “not never” revisited
• Alternation
• An automata-theoretic approach to branching-time model checking
• Program Complexity in Hierarchical Module Checking

This page was built for publication: