Revision as of 18:24, 13 June 2023 edit 78.22.198.37 (talk) No edit summary ← Previous edit		Revision as of 20:24, 30 October 2023 edit undo Citation bot (talk \| contribs) Bots 5,867,259 edits Alter: title, template type. Add: chapter-url, isbn, volume, series, chapter. Removed or converted URL. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:Model checking \| #UCB_Category 4/24 Next edit →
Line 11: Furthermore, for <math>I=(a,b)</math> an interval, <math>x\in I</math> is considered as an abbreviation for <math>x>a\land x<b</math>; and similarly for every other kind of intervals. The logic '''TPTL+Past'''<ref name="ExpressivenesOfTPTLAndMtl">{{cite ~~journal~~book \|last1=Bouyer \|first1=Patricia \|author1-link=Patricia Bouyer-Decitre\|last2=Chevalier \|first2=Fabrice \|last3=Markey \|first3=Nicolas \|title=OnFSTTCS ~~the~~2005: ~~Expressiveness~~Foundations of ~~TPTL~~Software Technology and ~~MTL~~Theoretical Computer Science \|chapter=Developments in Data Structure Research During the First 25 Years of FSTTCS \|series=Lecture Notes in Computer Science \|journal=Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science \|date=2005 \|volume=3821 \|page=436 \|doi=10.1007/11590156_3 \|isbn=978-3-540-30495-1 \|chapter-url=https://hal.archives-ouvertes.fr/hal-01194615/document}}</ref> is built as the future fragment of '''TLS''' and also contains * the temporal modal operator '''S'''.

Timed propositional temporal logic: Difference between revisions