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=138
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The algorithmic analysis of hybrid systems
R. Alur
,
C. Courcoubetis
,
N. Halbwachs
,
T.A. Henzinger
,
P.-H. Ho
,
X. Nicollin
,
A. Olivero
,
J. Sifakis
,
S. Yovine
Theoretical Computer Science
138
(1), 1995, pp. 3-34
Reachability analysis of dynamical systems having piecewise-constant derivatives
Eugene Asarin
,
Oded Maler
,
Amir Pnueli
Theoretical Computer Science
138
(1), 1995, pp. 35-65
Universal computation ond other capabilities of hybrid and continuous dynamical systems
Michael S. Branicky
Theoretical Computer Science
138
(1), 1995, pp. 67-100
An algebraic approach to hybrid systems
R.L. Grossman
,
R.G. Larson
Theoretical Computer Science
138
(1), 1995, pp. 101-112
Finite divergence
Michael R. Hansen
,
Paritosh K. Pandya
,
Zhou Chaochen
Theoretical Computer Science
138
(1), 1995, pp. 113-139
Viability in hybrid systems
Wolf Kohn
,
Anil Nerode
,
Jeffrey B. Remmel
,
Alexander Yakhnis
Theoretical Computer Science
138
(1), 1995, pp. 141-168
Metric temporal logic with durations
Yassine Lakhneche
,
Jozef Hooman
Theoretical Computer Science
138
(1), 1995, pp. 169-199
Inductively inferring valid logical models of continuous-state dynamical systems
Michael Lemmon
,
Panos J. Antsaklis
Theoretical Computer Science
138
(1), 1995, pp. 201-210
Constraint nets: A semantic model for hybrid dynamic systems
Ying Zhang
,
Alan K. Mackworth
Theoretical Computer Science
138
(1), 1995, pp. 211-239
A brief history of timed CSP
Jim Davies
,
Steve Schneider
Theoretical Computer Science
138
(2), 1995, pp. 243-271
Fixed points without completeness
M.W. Mislove
,
A.W. Roscoe
,
S.A. Schneider
Theoretical Computer Science
138
(2), 1995, pp. 273-314
Probabilistic and prioritized models of timed CSP
Gavin Lowe
Theoretical Computer Science
138
(2), 1995, pp. 315-352
Symbolic bisimulations
M. Hennessy
,
H. Lin
Theoretical Computer Science
138
(2), 1995, pp. 353-389
A process algebraic view of input/output automata
Rocco De Nicola
,
Roberto Segala
Theoretical Computer Science
138
(2), 1995, pp. 391-423
On the nature of events: Another perspective in concurrency
G. Michele Pinna
,
Acel Poigné
Theoretical Computer Science
138
(2), 1995, pp. 425-454