<--- Back to Details
First PageDocument Content
Finite automata / Timed automaton / Logic in computer science / Automated planning and scheduling / Fluent / Finite-state machine / Theoretical computer science / Planning Domain Definition Language / Models of computation
Date: 2015-02-02 08:45:53
Finite automata
Timed automaton
Logic in computer science
Automated planning and scheduling
Fluent
Finite-state machine
Theoretical computer science
Planning Domain Definition Language
Models of computation

Microsoft Word - IBSAlgorithms.doc

Add to Reading List

Source URL: foibg.com

Download Document from Source Website

File Size: 150,67 KB

Share Document on Facebook

Similar Documents

The Compositional Specication of Timed Systems A Tutorial Joseph Sifakis

The Compositional Speci cation of Timed Systems A Tutorial Joseph Sifakis

DocID: 1qQzE - View Document

Microsoft Word - Gomaa-ACES2011-submitted-4August2011.docx

Microsoft Word - Gomaa-ACES2011-submitted-4August2011.docx

DocID: 1qFi8 - View Document

Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

DocID: 1qBzD - View Document

C:/Users/giorgio/Documents/CVS_TAHN/main.dvi

C:/Users/giorgio/Documents/CVS_TAHN/main.dvi

DocID: 1qwDr - View Document

On the Verification of Timed Ad Hoc Networks Parosh Aziz Abdulla1 , Giorgio Delzanno2 , Othmane Rezine1 , Arnaud Sangnier3⋆ , and Riccardo Traverso2 1  Uppsala University

On the Verification of Timed Ad Hoc Networks Parosh Aziz Abdulla1 , Giorgio Delzanno2 , Othmane Rezine1 , Arnaud Sangnier3⋆ , and Riccardo Traverso2 1 Uppsala University

DocID: 1pyh8 - View Document