Luca Aceto
Luca Aceto
Department of Computer Science, Reykjavik University, and Gran Sasso Science Institute, L'Aquila
Verifierad e-postadress på ru.is - Startsida
TitelCiteras avÅr
Structural operational semantics
L Aceto, W Fokkink, C Verhoef
Handbook of process algebra, 197-292, 2001
3552001
Reactive systems: modelling, specification and verification
L Aceto, A Ingólfsdóttir, KG Larsen, J Srba
cambridge university press, 2007
3152007
Turning SOS Rules into Ecuations
B BLooM, F VAANDRAGER
Information and Computation 111, 1-52, 1994
1851994
Towards action-refinement in process algebras
L Aceto, M Hennessy
Information and Computation 103 (2), 204-269, 1993
1651993
Model checking via reachability testing for timed automata
L Aceto, A Burgueno, KG Larsen
International Conference on Tools and Algorithms for the Construction and …, 1998
1371998
Timing and causality in process algebra
L Aceto, D Murphy
Acta Informatica 33 (4), 317-350, 1996
1261996
Termination, deadlock, and divergence
L Aceto, M Hennessy
Journal of the ACM (JACM) 39 (1), 147-187, 1992
1201992
The power of reachability testing for timed automata
L Aceto, P Bouyer, A Burgueno, KG Larsen
Theoretical Computer Science 300 (1-3), 411-475, 2003
932003
Action refinement in process algebras
L Aceto
Cambridge University Press, 1992
731992
Adding action refinement to a finite process algebra
L Aceto, M Hennessy
Information and Computation 115 (2), 179-247, 1994
681994
Adding action refinement to a finite process algebra
L Aceto, M Hennessy
International Colloquium on Automata, Languages, and Programming, 506-519, 1991
681991
Testing equivalences for event structures
L Aceto, R De Nicola, A Fantechi
Mathematical models for the semantics of parallelism, 1-20, 1987
671987
A static view of localities
L Aceto
Formal Aspects of Computing 6 (2), 201-222, 1994
601994
Is your model checker on time? On the complexity of model checking for timed modal logics
L Aceto, F Laroussinie
The Journal of Logic and Algebraic Programming 52, 7-51, 2002
592002
The power of reachability testing for timed automata
L Aceto, P Bouyer, A Burgueño, KG Larsen
International Conference on Foundations of Software Technology and …, 1998
581998
On the ill-timed but well-caused
L Aceto, D Murphy
International Conference on Concurrency Theory, 97-111, 1993
571993
Axiomatizing prefix iteration with silent steps
L Aceto, R Van Glabbeek, W Fokkink, A Ingólfsdóttir
Information and Computation 127 (1), 26-40, 1996
561996
Multiparty session types as coherence proofs
M Carbone, F Montesi, C Schürmann, N Yoshida
Acta Informatica 54 (3), 243-269, 2017
512017
Finite equational bases in process algebra: Results and open questions
L Aceto, W Fokkink, A Ingolfsdottir, B Luttik
Processes, terms and cycles: steps on the road to infinity, 338-367, 2005
462005
A menagerie of non-finitely based process semantics over BPA*–from ready simulation to completed traces
L Aceto, W Fokkink, A Ingólfsdóttir
Mathematical Structures in Computer Science 8 (3), 193-230, 1998
371998
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20