SnS can be modally characterized
From MaRDI portal
Publication:914397
DOI10.1016/0304-3975(90)90140-DzbMath0701.68064MaRDI QIDQ914397
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
concurrent systems; tree languages; transitions; modal mu-calculus; Rabin's tree theorem; second-order monadic theory of n successors
68Q45: Formal languages and automata
03B45: Modal logic (including the logic of norms)
03C85: Second- and higher-order model theory
Related Items
Cites Work