Revision as of 00:02, 25 May 2021 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,670 edits Patricia Bouyer-Decitre ← Previous edit		Revision as of 04:59, 30 January 2023 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: doi added to citation with #oabot. Next edit →
Line 16: Note that the next operator '''N''' is not considered to be a part of MTL syntax. It will instead be defined from other operators. A '''closed formula''' is a formula over an empty set of clocks.<ref name="Really">{{cite journal \|last1=Alur \|first1=Rajeev \|last2=Henzinger \|first2=Thomas A. \|title=A really temporal logic\|journal=Journal of the ACM\|date=Jan 1994 \|volume=41 \|issue =1\|pages=181–203 \|doi=10.1145/174644.174651\|doi-access=free }}</ref> == Model ==

Timed propositional temporal logic: Difference between revisions