CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540583295, 9783540486541

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Characterizing bisimulation congruence in the π-Calculus

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015018 ◽

2005 ◽

pp. 331-350

Author(s):

Xinxin Liu

Keyword(s):

Π Calculus

Download Full-text

Probabilistic simulations for probabilistic processes

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015027 ◽

2005 ◽

pp. 481-496 ◽

Cited By ~ 66

Author(s):

Roberto Segala ◽

Nancy Lynch

Keyword(s):

Probabilistic Processes

Download Full-text

Invariants in process algebra with data

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015022 ◽

2005 ◽

pp. 401-416 ◽

Cited By ~ 12

Author(s):

Marc Bezem ◽

Jan Friso Groote

Keyword(s):

Process Algebra

Download Full-text

Verification of nonregular temporal properties for context-free processes

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015000 ◽

2005 ◽

pp. 81-97 ◽

Cited By ~ 1

Author(s):

Ahmed Bouajjani ◽

Rachid Echahed ◽

Riadh Robbana

Keyword(s):

Temporal Properties ◽

Context Free

Download Full-text

On the decidability of non-interleaving process equivalences

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0014995 ◽

2005 ◽

pp. 18-33 ◽

Cited By ~ 2

Author(s):

Astrid Kiehn ◽

Matthew Hennessy

Download Full-text

SProc categorically

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015005 ◽

2005 ◽

pp. 146-159

Author(s):

J. R. B. Cockett ◽

D. A. Spooner

Download Full-text

Fully abstract characterizations of testing preorders for probabilistic processes

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015028 ◽

2005 ◽

pp. 497-512 ◽

Cited By ~ 7

Author(s):

Shoji Yuen ◽

Rance Cleaveland ◽

Zeynep Dayar ◽

Scott A. Smolka

Keyword(s):

Probabilistic Processes

Download Full-text

Model-based verification methods and tools (abstract)

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0014998 ◽

2005 ◽

pp. 64-64

Author(s):

J. C. Fernandez ◽

J. Sifakis ◽

R. Simone

Keyword(s):

Model Based ◽

Verification Methods

Download Full-text

A symbolic semantics for the π-calculus — Extended abstract

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0015016 ◽

2005 ◽

pp. 299-314 ◽

Cited By ~ 1

Author(s):

Michele Boreale ◽

Rocco Nicola

Keyword(s):

Π Calculus

Download Full-text

Geometry of interaction (abstract)

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0014993 ◽

2005 ◽

pp. 1-1

Author(s):

Jean-Yves Girard

Download Full-text

CONCUR '94: Concurrency Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Characterizing bisimulation congruence in the π-Calculus

Probabilistic simulations for probabilistic processes

Invariants in process algebra with data

Verification of nonregular temporal properties for context-free processes

On the decidability of non-interleaving process equivalences

SProc categorically

Fully abstract characterizations of testing preorders for probabilistic processes

Model-based verification methods and tools (abstract)

A symbolic semantics for the π-calculus — Extended abstract

Geometry of interaction (abstract)

CONCUR '94: Concurrency Theory - Lecture Notes in Computer Science
Latest Publications