Correct, Reactive, High―Level Robot ControlKRESS-GAZIT, Hadas; WONGPIROMSARN, Tichakorn; TOPCU, Ufuk et al.IEEE robotics & automation magazine. 2011, Vol 18, Num 3, pp 65-74, issn 1070-9932, 10 p.Article

Raisonnement temporel dans les systèmes Experts = Temporal reasoning in expert systemERMINE, J.-L; CAUHAPE, D.Revue d'intelligence artificielle. 1990, Vol 4, Num 1, pp 99-136, issn 0992-499X, 38 p.Article

Relations temporelles symboliques : representations en algorithmes = Symbolic temporal relations: representation and algorithmsMAILK GHALLAB; ANINE NOUNIR ALAOUI.Revue d'intelligence artificielle. 1989, Vol 3, Num 3, pp 67-115, issn 0992-499X, 49 p.Article

Approximating ATL^* in ATLHARDING, Aidan; RYAN, Mark; SCHOBBENS, Pierre-Yves et al.Lecture notes in computer science. 2002, pp 289-301, issn 0302-9743, isbn 3-540-43631-6Conference Paper

Linear temporal logic and finite semigroupsWILKE, Thomas.Lecture notes in computer science. 2001, pp 96-110, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Using compositional preorders in the verification of Sliding window protocolKAIVOLA, R.Lecture notes in computer science. 1997, pp 48-59, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Minimal refinements of specifications in modal and temporal logicsGOROGIANNIS, Nikos; RYAN, Mark.Formal aspects of computing. 2007, Vol 19, Num 4, pp 417-444, issn 0934-5043, 28 p.Article

Vacuity detection in temporal model checkingKUPFERMAN, Orna; VARDI, Moshe Y.International journal on software tools for technology transfer (Print). 2003, Vol 4, Num 2, pp 224-233, issn 1433-2779, 10 p.Conference Paper

Why so many temporal logics climb up the trees?RABINOVICH, A; MAOZ, S.Lecture notes in computer science. 2000, pp 629-639, issn 0302-9743, isbn 3-540-67901-4Conference Paper

A common sense theory of causationBELL, John.Lecture notes in computer science. 2003, pp 40-53, issn 0302-9743, isbn 3-540-40380-9, 14 p.Conference Paper

Model checking a pathMARKEY, N; SCHNOEBELEN, P.Lecture notes in computer science. 2003, pp 251-265, issn 0302-9743, isbn 3-540-40753-7, 15 p.Conference Paper

From falsification to verificationPELED, Doron; PNUELI, Amir; ZUCK, Lenore et al.Lecture notes in computer science. 2001, pp 292-304, issn 0302-9743, isbn 3-540-43002-4Conference Paper

A dense-time Temporal Logic with nice Compositionality PropertiesCAU, A; DE ROEVER, W.-P.EUROCAST '97International conference on computer aided systems theory and technology. 1997, pp 71-72, isbn 84-88912-04-8Conference Paper

Adding partial orders to linear temporal logicBHAT, G; PELED, D.Lecture notes in computer science. 1997, pp 119-134, issn 0302-9743, isbn 3-540-63141-0Conference Paper

Temporal Logic in EngineeringKNIGHT, Brian; NISSAN, Ephraim; MA, Jixin et al.Artificial intelligence for engineering design, analysis and manufacturing. 1999, Vol 13, Num 2, issn 0890-0604, 76 p.Serial Issue

Combining forward and backward analyses of temporal propertiesMASSE, Damien.Lecture notes in computer science. 2001, pp 103-116, issn 0302-9743, isbn 3-540-42068-1Conference Paper

Cactus : A branching-time logic programming languageRONDOGIANNIS, P; GERGATSOULIS, M; PANAYIOTOPOULOS, T et al.Lecture notes in computer science. 1997, pp 511-524, issn 0302-9743, isbn 3-540-63095-3Conference Paper

Concurrent METATEM as a coordination languageKELLETT, A; FISHER, M.Lecture notes in computer science. 1997, pp 418-421, issn 0302-9743, isbn 3-540-63383-9Conference Paper

Representing and reasoning with events from natural languageLEITH, M; CUNNINGHAM, J.Lecture notes in computer science. 1997, pp 406-420, issn 0302-9743, isbn 3-540-63095-3Conference Paper

Undecidable verification problems for programs with unreliable channelsPAROSH AZIZ ABDULLA; JONSSON, B.Information and computation (Print). 1996, Vol 130, Num 1, pp 71-90, issn 0890-5401Article

Validity of CTL queries revisitedSAMER, Marko; VEITH, Helmut.Lecture notes in computer science. 2003, pp 470-483, issn 0302-9743, isbn 3-540-40801-0, 14 p.Conference Paper

Exchanging and combining temporal information in a cooperative environmentHADAD, Meirav; KRAUS, Sarit.Lecture notes in computer science. 2002, pp 279-286, issn 0302-9743, isbn 3-540-44173-5, 8 p.Conference Paper

NEXPTIME-complete Description logics with concrete domainsLUTZ, Carsten.Lecture notes in computer science. 2001, pp 45-60, issn 0302-9743, isbn 3-540-42254-4Conference Paper

A product version of dynamic linear time temporal logicHENRIKSEN, J. G; THIAGARAJAN, P. S.Lecture notes in computer science. 1997, pp 45-58, issn 0302-9743, isbn 3-540-63141-0Conference Paper

The state complexity of Σ*L and its connection with temporal logicBIRGET, J.-C.Information processing letters. 1996, Vol 58, Num 4, pp 185-188, issn 0020-0190Article