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=467
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial space hardness without disjunction property
Simone Bova
,
Franco Montagna
Theoretical Computer Science
467
, 2013, pp. 1-11
On the coverability and reachability languages of monotonic extensions of Petri nets
Giorgio Delzanno
,
Fernando Rosa-Velardo
Theoretical Computer Science
467
, 2013, pp. 12-29
Synthesis of sup-interpretations: A survey
Romain PĂ©choux
Theoretical Computer Science
467
, 2013, pp. 30-52
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
Markus N. Rabe
,
Sven Schewe
Theoretical Computer Science
467
, 2013, pp. 53-67
Information flow in systems with schedulers, Part I: Definitions
Ron van der Meyden
,
Chenyi Zhang
Theoretical Computer Science
467
, 2013, pp. 68-88
Efficient model-checking of dense-time systems with time-convexity analysis
Farn Wang
Theoretical Computer Science
467
, 2013, pp. 89-108