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

TOTAL DOCUMENTS

39

(FIVE YEARS 0)

H-INDEX

14

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540440437, 9783540456940

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Author(s):

Beata Konikowska ◽

Wojciech Penczek

Keyword(s):

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 ◽

Author(s):

H. C. M. Kleijn ◽

M. Koutny

Keyword(s):

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 ◽

Author(s):

Mikkel Nygaard ◽

Glynn Winskel

Keyword(s):

Higher Order ◽

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

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 ◽

Author(s):

Massimo Merro ◽

Vladimiro Sassone

Download Full-text

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

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 ◽

Author(s):

Maria Grazia Buscemi ◽

Ugo Montanari

Keyword(s):

Observational Equivalence ◽

First Order ◽

Download Full-text

A Deductive Proof System for CTL*

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

10.1007/3-540-45694-5_2 ◽

2002 ◽

pp. 24-40 ◽

Author(s):

Amir Pnueli ◽

Yonit Kesten

Keyword(s):

Proof System ◽

Deductive Proof

Download Full-text

Using Ambients to Control Resources*

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

10.1007/3-540-45694-5_20 ◽

2002 ◽

pp. 288-303 ◽

Author(s):

David Teller ◽

Pascal Zimmer ◽

Daniel Hirschkoff

Download Full-text