Fulltext present in this item

Thumbnail
Fulltext: 75615.pdf
Format: PDF
Description: publisher's version
Embargo: until further notice
Title: Undecidability of cost-bounded reachability in priced probabilistic timed automata
Author(s): Berendsen, J.K. ; Chen, Taolue; Jansen, David
Publication year: 2009
In: Lecture Notes in Computer Science, (2009)Chen, Jianer; Cooper, S. Barry (ed.), Theory and Applications of Models of Computation : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 128-137
Publisher: Berlin : Springer
ISBN: 9783642020162
ISSN: 0302-9743
Annotation: 6th Annual Conference, TAMC 2009, 18 mei 2009
Publication type: Article in monograph or in proceedings

Please use this identifier to cite or link to this item : https://hdl.handle.net/2066/75615   https://hdl.handle.net/2066/75615

Display more details
Editor(s): Chen, Jianer; Cooper, S. Barry
Subject: Software Science
Organization: Software Science
Journal title:
Lecture Notes in Computer Science
Book title: Chen, Jianer; Cooper, S. Barry (ed.), Theory and Applications of Models of Computation : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings
Page start: p. 128
Page end: p. 137

This item appears in the following Collection(s)

Browse

Statistics