404

Testing Equivalences for Processes
– R. De Nicola, M. C. B. Hennessy
 1984

3204

Communication and Concurrency
– R Milner
 1989

3400

Communicating Sequential Processes
– C. A. R. Hoare
 1985

311

Calculi for Synchrony and Asynchrony
– R Milner
 1983

146

The NCSU Concurrency Workbench
– Rance Cleaveland, Steve Sims
 1996

178

CCS expressions, finite state processes, and three problems of equivalence
– P C Kanellakis, S A Smolka
 1990

353

Three partition refinement algorithms
– R Paige, R E Tarjan
 1987

202

The Concurrency Workbench: A semanticsbased tool for the verification of finitestate systems
– R Cleaveland, J Parrow, B Steffen
 1993

194

Bisimulation can’t be traced
– B Bloom, S Istrail, A R Meyer
 1995

393

Algebraic Theory of Processes
– M Hennessy
 1988

403

Bisimulation through probabilistic testing
– Kim G. Larsen, Arne Skou
 1989

289

The Linear TimeBranching Time Spectrum II  The semantics of sequential systems with silent moves
– R.J. van Glabbeek
 1993

1329

A calculus of communicating systems
– R Milner
 1980

29

P.: A linear algorithm to solve fixedpoint equations on transition systems
– A Arnold, Crubillé

271

Automatic Verification of finite state concurrent systems using temporal logic specifications
– E M Clarke, E A Emerson, A P Sistla

3

When is `Partial' Adequate? A LogicBased Proof Technique for Partial Specifications
– R Cleaveland, B Steffen
 1990

91

TableauBased Model Checking in the Propositional MuCalculus
– Rance Cleaveland
 1990

7

Experiment with Auto and Autograph on a Simple Case Sliding Window Protocol
– G Boudol, R de Simone, D Vergamini
 1988

27

Process calculi, from theory to practice: Verification tools
– Gérard Boudol, Valérie Roy, Robert de Simone, Didier Vergamini
 1989
