Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=538
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
Pedro Adão
,
Paulo Mateus
,
Luca Viganò
Theoretical Computer Science
538
, 2014, pp. 2-15
Real-reward testing for probabilistic processes
Yuxin Deng
,
Rob van Glabbeek
,
Matthew Hennessy
,
Carroll Morgan
Theoretical Computer Science
538
, 2014, pp. 16-36
Local abstraction refinement for probabilistic timed programs
Klaus Dräger
,
Marta Kwiatkowska
,
David Parker
,
Hongyang Qu
Theoretical Computer Science
538
, 2014, pp. 37-53
The quantitative linear-time-branching-time spectrum
Uli Fahrenberg
,
Axel Legay
Theoretical Computer Science
538
, 2014, pp. 54-69
Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes
Sergio Giro
Theoretical Computer Science
538
, 2014, pp. 70-83
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms
Sergio Giro
,
Pedro R. D'Argenio
,
Luis María Ferrer Fioriti
Theoretical Computer Science
538
, 2014, pp. 84-102
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
Henri Hansen
,
Mark Timmer
Theoretical Computer Science
538
, 2014, pp. 103-123
Precise quantitative information flow analysis - A symbolic approach
Vladimir Klebanov
Theoretical Computer Science
538
, 2014, pp. 124-139
Exact fluid lumpability in Markovian process algebra
Max Tschaikowski
,
Mirco Tribastone
Theoretical Computer Science
538
, 2014, pp. 140-166
Quantitative information flow as safety and liveness hyperproperties
Hirotoshi Yasuoka
,
Tachio Terauchi
Theoretical Computer Science
538
, 2014, pp. 167-182