Show simple item record

dc.contributor.authorVasile, Cristian-Ioanen_US
dc.contributor.authorAksaray, Deryaen_US
dc.contributor.authorBelta, Calinen_US
dc.date.accessioned2018-06-27T14:58:52Z
dc.date.available2018-06-27T14:58:52Z
dc.date.issued2017-08-29
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000410868000003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e74115fe3da270499c3d65c9b17d654
dc.identifier.citationCristian-Ioan Vasile, Derya Aksaray, Calin Belta. 2017. "Time window temporal logic." THEORETICAL COMPUTER SCIENCE, v. 691, pp. 27 - 54 (28).
dc.identifier.issn0304-3975
dc.identifier.issn1879-2294
dc.identifier.urihttps://hdl.handle.net/2144/29723
dc.description.abstractThis paper introduces time window temporal logic (TWTL), a rich expressive language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are prevalent in various applications including robotics, sensor systems, and manufacturing systems. This paper also discusses the relaxation of TWTL formulae with respect to the deadlines of the tasks. Efficient automata-based frameworks are presented to solve synthesis, verification and learning problems. The key ingredient to the presented solution is an algorithm to translate a TWTL formula to an annotated finite state automaton that encodes all possible temporal relaxations of the given formula. Some case studies are presented to illustrate the expressivity of the logic and the proposed algorithms.en_US
dc.format.extentp. 27 - 54en_US
dc.languageEnglish
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofTHEORETICAL COMPUTER SCIENCE
dc.rights© 2017 Elsevier B.V. All rights reserved.en_US
dc.subjectTimed temporal logicen_US
dc.subjectTemporal relaxationen_US
dc.subjectController synthesisen_US
dc.subjectVerificationen_US
dc.subjectFinite state automataen_US
dc.subjectUnambiguous languagesen_US
dc.subjectScience & technologyen_US
dc.subjectComputer science, theory & methodsen_US
dc.subjectComputer scienceen_US
dc.subjectTransition complexityen_US
dc.subjectConstraintsen_US
dc.subjectSpecificationsen_US
dc.subjectConstructionen_US
dc.subjectAlgorithmsen_US
dc.subjectAutomataen_US
dc.subjectInformation and computing sciencesen_US
dc.subjectMathematical sciencesen_US
dc.subjectComputation theory & mathematicsen_US
dc.titleTime window temporal logicen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.tcs.2017.07.012
pubs.elements-sourceweb-of-scienceen_US
pubs.notesEmbargo: Not knownen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Mechanical Engineeringen_US
pubs.publication-statusPublisheden_US


This item appears in the following Collection(s)

Show simple item record