scientific article; zbMATH DE number 7439738
From MaRDI portal
Publication:5015276
zbMath1478.68158MaRDI QIDQ5015276
Aniello Murano, Loredana Sorrentino, Gaëlle Fontaine, Giuseppe Perelli, Fabio Mogavero
Publication date: 7 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2016.12
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (2)
An automata-theoretic approach to the verification of distributed algorithms ⋮ Cycle detection in computation tree logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textit{Once} and \textit{for all}
- Pushdown module checking
- From liveness to promptness
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Module checking
- Automata, logics, and infinite games. A guide to current research
- Decision procedures and expressiveness in the temporal logic of branching time
- On Promptness in Parity Games*†
- Finitary winning in ω-regular games
- Reasoning About Strategies
- Temporal logic can be more expressive
- Alternating-time temporal logic
- Enriched MU-Calculi Module Checking
- The Complexity of Enriched Mu-Calculi
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- “Sometimes” and “not never” revisited
- Deterministic generators and games for Ltl fragments
- An automata-theoretic approach to branching-time model checking
- TYPENESS FOR ω-REGULAR AUTOMATA
This page was built for publication:
