Buy one, get one free!!!
From MaRDI portal
Publication:4895547
DOI10.1093/logcom/6.4.523zbMath0857.03009OpenAlexW1969404042MaRDI QIDQ4895547
Publication date: 17 November 1996
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/6.4.523
Related Items
Complexity of synthesis of composite service with correctness guarantee ⋮ Pushdown module checking ⋮ Specification in CTL + past for verification in CTL. ⋮ Module checking ⋮ An infinite hierarchy of temporal logics over branching time