CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113zbMath1097.03504OpenAlexW2499482941MaRDI QIDQ5311502

Igor Walukiewicz, Mikołaj Bojańczyk

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items (5)

Axiomatizing the equational theory of regular tree languages ⋮ A note on the characterization of TL [EF] ⋮ Automata for XML -- a survey ⋮ Characterizing CTL-like logics on finite trees. ⋮ Cascade Products and Temporal Logics on Finite Trees

This page was built for publication: CONCUR 2004 - Concurrency Theory