CCS expressions, finite state processes, and three problems of equivalence

Information and Computation

Volumn 86, Issue 1, 1990, Pages 43-68

  Kanellakis, Paris C ^a   Smolka, Scott A ^b  

^a BROWN UNIVERSITY   (United States)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--FINITE AUTOMATA; COMPUTER SYSTEMS, DIGITAL--DISTRIBUTED;

CALCULUS OF COMMUNICATING SYSTEMS; CCS EXPRESSIONS; EQUIVALENCE PROBLEMS; FINITE STATE PROCESSES;

COMPUTER METATHEORY;

EID: 0025432462     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(90)90025-D     Document Type: Article

References (24)

1. Bisimulation of automata
2. Algebra of communicating processes
3. On the relationship of CCS and CSP
4. A theory of communicating sequential processes
5. Behavioural equivalence relationships induced by programming logics
6. Matrix multiplication via arithmetic progressions
7. Acceptance trees
8. Algebraic laws for nondeterminism and concurrency
9. An nlogn algorithm for minimizing states in a finite automaton
10. CCS expressions finite state processes and three problems of equivalence
11. On the analysis of cooperation and antagonism in networks of communicating processes
12. A calculus of communicating systems
13. Calculi for synchrony and asynchrony
14. A complete inference system for a class of regular behaviors
15. Testing equivalences for processes
16. Three partition refinement algorithms
17. Two complete axiom systems for the algebra of regular events
18. Analysis of Communicating Finite-State Processes
19. Word problems requiring exponential time