CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

13

(FIVE YEARS 0)

Published By Springer-Verlag

3540530487

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Transition system specifications with negative premises

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039069 ◽

2006 ◽

pp. 332-341 ◽

Author(s):

Jan Friso Groote

Keyword(s):

Transition System

Download Full-text

Testing equivalences and fully abstract models for probabilistic processes

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039056 ◽

2006 ◽

pp. 126-138 ◽

Author(s):

Ivan Christoff

Keyword(s):

Probabilistic Processes

Download Full-text

A temporal calculus of communicating systems

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039073 ◽

2006 ◽

pp. 401-415 ◽

Author(s):

Faron Moller ◽

Chris Tofts

Download Full-text

A new strategy for proving ω-completeness applied to process algebra

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039068 ◽

2006 ◽

pp. 314-331 ◽

Author(s):

Jan Friso Groote

Keyword(s):

Process Algebra ◽

Download Full-text

A programming logic for formal concurrent systems

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039067 ◽

2006 ◽

pp. 298-313 ◽

Author(s):

E. Pascal Gribomont

Keyword(s):

Concurrent Systems ◽

Programming Logic

Download Full-text

Rewriting as a unified model of concurrency

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039072 ◽

2006 ◽

pp. 384-400 ◽

Author(s):

José Meseguer

Keyword(s):

Download Full-text

Synthesis rules for Petri nets, and how they lead to new results

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039060 ◽

2006 ◽

pp. 182-198 ◽

Author(s):

Javier Esparza

Keyword(s):

Download Full-text

Delay-insensitive circuits: An algebraic approach to their design

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039070 ◽

2006 ◽

pp. 342-366 ◽

Author(s):

Mark B. Josephs ◽

Jan Tijmen Udding

Keyword(s):

Algebraic Approach

Download Full-text

Factorization of finite state machines under observational equivalence

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039075 ◽

2006 ◽

pp. 427-441 ◽

Author(s):

Huajun Qin ◽

Philip Lewis

Keyword(s):

Finite State Machines ◽

State Machines ◽

Observational Equivalence ◽

Download Full-text

Equivalences, congruences, and complete axiomatizations for probabilistic processes

CONCUR '90 Theories of Concurrency: Unification and Extension - Lecture Notes in Computer Science ◽

10.1007/bfb0039071 ◽

2006 ◽

pp. 367-383 ◽

Author(s):

Chi-Chang Jou ◽

Scott A. Smolka

Keyword(s):

Probabilistic Processes

Download Full-text