Timed Automata Can Always Be Made Implementable

Patricia Bouyer, Kim Guldstrand Larsen, Nicholas Markey, Ocan Sankur, C. Thrane

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

16 Citationer (Scopus)
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind6901 LNCS
Sider (fra-til)76-91
Antal sider16
ISSN0302-9743
DOI
StatusUdgivet - 1 jan. 2011
Begivenhed22nd International Conference on Concurrency Theory - Aachen, Tyskland
Varighed: 6 sep. 20119 sep. 2011
Konferencens nummer: 22

Konference

Konference22nd International Conference on Concurrency Theory
Nummer22
LandTyskland
ByAachen
Periode06/09/201109/09/2011

Bibliografisk note

Proceedings of the 22nd International Conference on Concurrency Theory. Katoen, J.-P. & König, B. (eds.)

Fingeraftryk Dyk ned i forskningsemnerne om 'Timed Automata Can Always Be Made Implementable'. Sammen danner de et unikt fingeraftryk.

Citationsformater