The complexity of the temporal logic with ``until over general linear time

From MaRDI portal
Publication:1400578

DOI10.1016/S0022-0000(03)00005-9zbMath1019.03014MaRDI QIDQ1400578

M. A. Reynolds

Publication date: 13 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)




Related Items (11)



Cites Work


This page was built for publication: The complexity of the temporal logic with ``until over general linear time