Polynomial distinguishability of timed automata

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Original languageUndefined/Unknown
Title of host publicationICGI
EditorsA Clark, F Coste, Laurent Miclet
PublisherSpringer
Pages238-251
Number of pages14
ISBN (Print)0302-9743
Publication statusPublished - 2008

Publication series

Name
PublisherSpringer
NameLecture Notes in Artificial Intelligence
Volume5278
ISSN (Print)0302-9743

Keywords

  • CWTS JFIS < 0.75

Cite this

Verwer, SE., de Weerdt, MM., & Witteveen, C. (2008). Polynomial distinguishability of timed automata. In A. Clark, F. Coste, & L. Miclet (Eds.), ICGI (pp. 238-251). (Lecture Notes in Artificial Intelligence; Vol. 5278). Springer.