scientific article; zbMATH DE number 4039302
From MaRDI portal
Publication:3777459
zbMATH Open0637.68059MaRDI QIDQ3777459FDOQ3777459
Authors: Scott A. Smolka, Paris C. Kanellakis 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- On the analysis of cooperation and antagonism in networks of communicating processes
- CCS expressions, finite state processes, and three problems of equivalence
- Analysis of a class of communicating finite state machines
- scientific article; zbMATH DE number 3874589
- scientific article; zbMATH DE number 2102770
testingNP-completenetwork protocolsdistributed computing systemsfinite state processesFSP equivalence
Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Cited In (5)
- On the analysis of cooperation and antagonism in networks of communicating processes
- Static Analysis of Dynamic Communication Systems by Partner Abstraction
- Reachability for finite-state process algebras using static analysis
- Closed Covers: To Verify Progress for Communicating Finite State Machines
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777459)
