COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS

DOI10.1142/S0129054109006929zbMath1182.68118MaRDI QIDQ3646170

Ingo Felscher, Wolfgang Thomas

Publication date: 19 November 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Presburger arithmeticcomposition theoremFeferman-Vaught theoremfinitely synchronized products

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Algorithmic uses of the Feferman-Vaught theorem
• Model theory.
• The monadic theory of order
• Products of modal logics, part 1
• Selection and Uniformization in Generalized Product
• On direct products of theories

This page was built for publication: COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS