First Page | Document Content | |
---|---|---|
Date: 2018-02-27 19:23:46Temporal logic Algebraic structures Mathematics Mathematical logic Theoretical computer science Linear temporal logic Logic in computer science Computation tree logic MVS Boolean domain Boolean algebra Finite-state machine | Optimal Multi-Valued LTL Planning for Systems with Access Right Levels Mohammad Hekmatnejad, and Georgios Fainekos Abstract— We propose a method for optimal Linear Temporal Logic (LTL) planning under incomplete or unceAdd to Reading ListSource URL: www.public.asu.eduDownload Document from Source WebsiteFile Size: 392,54 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |