Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540283096, 9783540319344

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Benefits of Exposing Calls and Returns

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_2 ◽

2005 ◽

pp. 2-3 ◽

Cited By ~ 1

Author(s):

Rajeev Alur

Download Full-text

On Implementation of Global Concurrent Systems with Local Asynchronous Controllers

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_34 ◽

2005 ◽

pp. 443-457 ◽

Cited By ~ 5

Author(s):

Blaise Genest

Keyword(s):

Concurrent Systems

Download Full-text

Defining Fairness

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_35 ◽

2005 ◽

pp. 458-472 ◽

Cited By ~ 12

Author(s):

Hagen Völzer ◽

Daniele Varacca ◽

Ekkart Kindler

Download Full-text

SOS for Higher Order Processes

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_25 ◽

2005 ◽

pp. 308-322 ◽

Cited By ~ 4

Author(s):

MohammadReza Mousavi ◽

Murdoch J. Gabbay ◽

Michel A. Reniers

Keyword(s):

Higher Order

Download Full-text

Constraint Solving for Contract-Signing Protocols

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_20 ◽

2005 ◽

pp. 233-247 ◽

Cited By ~ 7

Author(s):

Detlef Kähler ◽

Ralf Küsters

Keyword(s):

Constraint Solving ◽

Contract Signing

Download Full-text

Selecting Theories and Recursive Protocols

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_19 ◽

2005 ◽

pp. 217-232 ◽

Cited By ~ 9

Author(s):

Tomasz Truderung

Download Full-text

Timed Shuffle Expressions

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_11 ◽

2005 ◽

pp. 95-109 ◽

Cited By ~ 3

Author(s):

Cătălin Dima

Download Full-text

Timed Spi-Calculus with Types for Secrecy and Authenticity

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_18 ◽

2005 ◽

pp. 202-216 ◽

Cited By ~ 8

Author(s):

Christian Haack ◽

Alan Jeffrey

Download Full-text

Multiport Interaction Nets and Concurrency

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_6 ◽

2005 ◽

pp. 21-35 ◽

Cited By ~ 5

Author(s):

Damiano Mazza

Download Full-text

Deriving Weak Bisimulation Congruences from Reduction Systems

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory ◽

10.1007/11539452_24 ◽

2005 ◽

pp. 293-307 ◽

Cited By ~ 7

Author(s):

Roberto Bruni ◽

Fabio Gadducci ◽

Ugo Montanari ◽

Paweł Sobociński

Keyword(s):

Weak Bisimulation

Download Full-text

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency TheoryLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Benefits of Exposing Calls and Returns

On Implementation of Global Concurrent Systems with Local Asynchronous Controllers

Defining Fairness

SOS for Higher Order Processes

Constraint Solving for Contract-Signing Protocols

Selecting Theories and Recursive Protocols

Timed Shuffle Expressions

Timed Spi-Calculus with Types for Secrecy and Authenticity

Multiport Interaction Nets and Concurrency

Deriving Weak Bisimulation Congruences from Reduction Systems

Lecture Notes in Computer Science - CONCUR 2005 – Concurrency Theory
Latest Publications