CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540440437, 9783540456940

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Types for Cryptographic Protocols

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_7 ◽

2002 ◽

pp. 99-100

Author(s):

Andrew D. Gordon

Keyword(s):

Cryptographic Protocols

Download Full-text

Reducing Model Checking from Multi-valued CTL* to CTL*

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_16 ◽

2002 ◽

pp. 226-239 ◽

Cited By ~ 10

Author(s):

Beata Konikowska ◽

Wojciech Penczek

Keyword(s):

Model Checking

Download Full-text

Introduction to Modal and Temporal Mu-Calculi

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_6 ◽

2002 ◽

pp. 98-98

Author(s):

Julian C. Bradfield

Download Full-text

Causality Semantics of Petri Nets with Weighted Inhibitor Arcs

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_35 ◽

2002 ◽

pp. 531-546 ◽

Cited By ~ 2

Author(s):

H. C. M. Kleijn ◽

M. Koutny

Keyword(s):

Petri Nets

Download Full-text

HOPLA—A Higher-Order Process Language

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_29 ◽

2002 ◽

pp. 434-448 ◽

Cited By ~ 3

Author(s):

Mikkel Nygaard ◽

Glynn Winskel

Keyword(s):

Higher Order ◽

Order Process

Download Full-text

Axiomatizing an Algebra of Step Reactions for Synchronous Languages

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_26 ◽

2002 ◽

pp. 386-401

Author(s):

Gerald Lüttgen ◽

Michael Mendler

Keyword(s):

Synchronous Languages

Download Full-text

A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence*

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_30 ◽

2002 ◽

pp. 449-465 ◽

Cited By ~ 7

Author(s):

Maria Grazia Buscemi ◽

Ugo Montanari

Keyword(s):

Observational Equivalence ◽

First Order ◽

Π Calculus

Download Full-text

Typing and Subtyping Mobility in Boxed Ambients*

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_21 ◽

2002 ◽

pp. 304-320 ◽

Cited By ~ 20

Author(s):

Massimo Merro ◽

Vladimiro Sassone

Download Full-text

Regular Model Checking Made Simple and Effcient*

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_9 ◽

2002 ◽

pp. 116-131 ◽

Cited By ~ 25

Author(s):

Parosh Aziz Abdulla ◽

Bengt Jonsson ◽

Marcus Nilsson ◽

Julien d'Orso

Keyword(s):

Model Checking ◽

Regular Model ◽

Regular Model Checking

Download Full-text

Undecidability of Weak Bisimilarity for Pushdown Processes

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_38 ◽

2002 ◽

pp. 579-594 ◽

Cited By ~ 10

Author(s):

Jiří Srba

Download Full-text

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Types for Cryptographic Protocols

Reducing Model Checking from Multi-valued CTL* to CTL*

Introduction to Modal and Temporal Mu-Calculi

Causality Semantics of Petri Nets with Weighted Inhibitor Arcs

HOPLA—A Higher-Order Process Language

Axiomatizing an Algebra of Step Reactions for Synchronous Languages

A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence*

Typing and Subtyping Mobility in Boxed Ambients*

Regular Model Checking Made Simple and Effcient*

Undecidability of Weak Bisimilarity for Pushdown Processes

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science
Latest Publications