<--- Back to Details
First PageDocument Content
Finite automata / Timed automaton / Muller automaton / Deterministic automaton / Finite-state machine / Regular language / Nondeterministic finite automaton / Alphabet / Automata theory / -automaton
Date: 2014-03-05 16:37:08
Finite automata
Timed automaton
Muller automaton
Deterministic automaton
Finite-state machine
Regular language
Nondeterministic finite automaton
Alphabet
Automata theory
-automaton

PII:

Add to Reading List

Source URL: www.cis.upenn.edu

Download Document from Source Website

File Size: 3,12 MB

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