Seguir
Hans Hüttel
Hans Hüttel
Associate Professor, Aalborg University
Dirección de correo verificada de cs.aau.dk
Título
Citado por
Citado por
Año
Foundations of session types and behavioural contracts
H Hüttel, I Lanese, VT Vasconcelos, L Caires, M Carbone, PM Deniélou, ...
ACM Computing Surveys (CSUR) 49 (1), 1-36, 2016
2732016
Bisimulation equivalence is decidable for all context-free processes
S Christensen, H Huttel, C Stirling
Information and Computation 121 (2), 143-148, 1995
1351995
Bisimulation equivalence is decidable for all context-free processes
S Christensen, H Hüttel, C Stirling
CONCUR'92: Third International Conference on Concurrency Theory Stony Brook …, 1992
1191992
Actions speak louder than words: Proving bisimilarity for context-free processes
H Huttel, C Stirling
Proceedings 1991 Sixth Annual IEEE Symposium on Logic in Computer Science …, 1991
116*1991
Undecidable equivalences for basic process algebra
JF Groote, H Huttel
Information and Computation 115 (2), 354-371, 1994
1141994
The use of static constructs in a model process logic
H Hüttel, KG Larsen
International Symposium on Logical Foundations of Computer Science, 163-180, 1989
801989
Undecidable equivalences for basic parallel processes
H Hüttel
International Symposium on Theoretical Aspects of Computer Software, 454-464, 1994
78*1994
Deciding framed bisimilarity
H Hüttel
Electronic Notes in Theoretical Computer Science 68 (6), 1-18, 2003
632003
If PBL is the answer, then what is the problem?
H Hüttel, D Gnaur
Journal of Problem Based Learning in Higher Education 5 (2), 2017
402017
Transitions and trees: an introduction to structural operational semantics
H Hüttel
Cambridge University Press, 2010
322010
Bisimulations for asynchronous mobile processes
M Hansen, H Hüttel, J Kleist
BRICS Report Series 3 (8), 1996
311996
Silence is golden: Branching bisimilarity is decidable for context-free processes
H Hüttel
Computer Aided Verification: 3rd International Workshop, CAV'91 Aalborg …, 1992
311992
Decidability, behavioural equivalences and infinite transition graphs
H Hüttel
University of Edinburgh. College of Science and Engineering. School of …, 1991
291991
Towards automatic bisimilarity checking in the spi calculus
AS Elkjær, M Höhle, H Hüttel, K Overgård
Combinatorics, Computation & Logic 21 (3), 175-189, 1999
231999
Recursion versus replication in simple cryptographic protocols
H Hüttel, J Srba
SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on …, 2005
222005
Deciding framed bisimilarity
H Huttel
Proceedings of INFINITY 68, 2002
212002
Modal logics for cryptographic processes
U Frendrup, H Hüttel, JN Jensen
Electronic Notes in Theoretical Computer Science 68 (2), 124-141, 2002
202002
Decidability issues for infinite-state processes- a survey
S Christensen, H Hüttel
Bulletin of the EATCS 51, 155-167, 1993
201993
Typed ψ-calculi
H Hüttel
International Conference on Concurrency Theory, 265-279, 2011
182011
Objects as mobile processes
H Hüttel, J Kleist
BRICS, Department of Computer Science, Univ., 1996
181996
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20