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: Author="Lanotte, Ruggero"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reachability results for timed automata with unbounded data structures
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Angelo Troina
Acta Informatica
47
(5-6), 2011, pp. 279-311
Complexity and succinctness issues for linear-time hybrid logics
Laura Bozzelli
,
Ruggero Lanotte
Theoretical Computer Science
411
(2), 2010, pp. 454-469
Weak bisimulation for Probabilistic Timed Automata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Angelo Troina
Theoretical Computer Science
411
(50), 2010, pp. 4291-4322
Taylor approximation for hybrid systems
Ruggero Lanotte
,
Simone Tini
Information and Computation
205
(11), 2007, pp. 1575-1607
Monotonic hybrid systems
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
Journal of Computer and System Sciences
71
(1), 2005, pp. 34-69
Structural model checking for communicating hierarchical machines
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Adriano Peron
Lecture Notes in Computer Science
3153
, 2004, pp. 525-536
\varepsilon
-transitions in concurrent timed auatomata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Information Processing Letters
89
(1), 2004, pp. 1-7
Concurrency in timed automata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Theoretical Computer Science
309
(1-3), 2003, pp. 503-527
Timed automata with monotonic activities
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
Lecture Notes in Computer Science
1893
, 2000, pp. 518-527