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
[1]
Hilfe
Suche: Author="Tini, Simone"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compositional semantics and behavioural equivalences for reaction systems with restriction
Giovanni Pardini
,
Roberto Barbuti
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
,
Simone Tini
Theoretical Computer Science
551
, 2014, pp. 1-21
Foundational aspects of multiscale modeling of biological systems with process algebras
Roberto Barbuti
,
Giulio Caravagna
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
,
Simone Tini
Theoretical Computer Science
431
, 2012, pp. 96-116
Regular languages with variables on graphs
Simone Santini
Information and Computation
211
, 2012, pp. 1-28
An overview on operational semantics in membrane computing
Roberto Barbuti
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
,
Simone Tini
International Journal of Foundations of Computer Science
22
(1), 2011, pp. 119-131
Non-expansive
\epsilon
-bisimulations for probabilistic processes
Simone Tini
Theoretical Computer Science
411
(22-24), 2010, pp. 2202-2222
On constructor rewrite systems and the lambda-calculus
Ugo Dal Lago
,
Simone Martini
Lecture Notes in Computer Science
5556
, 2009, pp. 163-174
Compositional semantics and behavioral equivalences for P systems
Roberto Barbuti
,
Andrea Maggiolo-Schettini
,
Paolo Milazzo
,
Simone Tini
Theoretical Computer Science
395
(1), 2008, pp. 77-100
The weak lambda calculus as a reasonable machine
Ugo Dal Lago
,
Simone Martini
Theoretical Computer Science
398
(1-3), 2008, pp. 32-50
Taylor approximation for hybrid systems
Ruggero Lanotte
,
Simone Tini
Information and Computation
205
(11), 2007, pp. 1575-1607
(Optimal) duplication is not elementary recursive
Andrea Asperti
,
Paolo Coppola
,
Simone Martini
Information and Computation
193
(1), 2004, pp. 21-56
Phase semantics and decidability of elementary affine logic
Ugo Dal Lago
,
Simone Martini
Theoretical Computer Science
318
(3), 2004, pp. 409-433
\varepsilon
-transitions in concurrent timed auatomata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Information Processing Letters
89
(1), 2004, pp. 1-7
Coherence for sharing proof-nets
Stefano Guerrini
,
Simone Martini
,
Andrea Masini
Theoretical Computer Science
294
(3), 2003, pp. 379-409
Concurrency in timed automata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Simone Tini
Theoretical Computer Science
309
(1-3), 2003, pp. 503-527
A comparison of statecharts step semantics
Andrea Maggiolo-Schettini
,
Adriano Peron
,
Simone Tini
Theoretical Computer Science
290
(1), 2003, pp. 465-498
An axiomatic semantics for the synchronous language Gentzen
Simone Tini
Journal of Computer and System Sciences
66
(2), 2003, pp. 316-348
On disjunction of literals in triggers of statecharts transitions
Andrea Maggiolo-Schettini
,
Simone Tini
Information Processing Letters
84
(6), 2002, pp. 305-310
Proof nets, garbage, and computations
Stefano Guerrini
,
Simone Martini
,
Andrea Masini
Theoretical Computer Science
253
(2), 2001, pp. 185-237
An axiomatic semantics for Esterel
Simone Tini
Theoretical Computer Science
269
(1-2), 2001, pp. 231-282
Experiments in linear natural deduction
Simone Martini
,
Andrea Masini
Theoretical Computer Science
176
(1-2), 1997, pp. 159-173
An extension of system
F
with subtyping
Luca Cardelli
,
Simone Martini
,
John C. Mitchell
,
Andre Scedrov
Information and Computation
109
(1/2), 1994, February/March, pp. 4-56
Categorical models of polymorphism
Andrea Asperti
,
Simone Martini
Information and Computation
99
(1), 1992, July, pp. 1-79