Parallel complexity in the design and analysis of concurrent systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 505 LNCS, Issue , 1991, Pages 288-303

  Àlvarez, Carme ^a   Balcázar, José L ^a   Gabarró, Joaquim ^a   Sántha, Miklós ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CNRS   (France)

Author keywords

Boolean circuits; CCS; P completeness; Partially commutative monoids; Petri nets; PRAM algorithms

Indexed keywords

ALGEBRA; COMPUTER CIRCUITS; PETRI NETS;

BOOLEAN CIRCUIT; COMMUTATIVE MONOIDS; DESIGN AND ANALYSIS; FINITE STATE SYSTEMS; LABELLED TRANSITION SYSTEMS; P-COMPLETENESS; PARALLEL COMPLEXITY; PRAM ALGORITHMS;

PARALLEL ARCHITECTURES;

EID: 85033693015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-25209-3_20     Document Type: Conference Paper

References (27)

1. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1975).
2. 1-formulae on finite structures. Ann. Pure Appl. Logic 24,1-48 (1983).
3. Àlvarez, C, Gabarró, J.: The parallel complexity of two problems on concurrency. To appear at IPL.
4. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. Springer Verlag EATCS Monographs in Theoretical Computer Science, v. 11 (1988).
5. Balcázar, J., Gabarró, J., Sántha, M.: Deciding bisimilarity is P-complete. Report LSI-90-25, Universitat Politècnica de Catalunya. Submitted for publication.
6. 1. J. Comp. Syst. Set. 41,274-306 (1990).
7. Chandra, A.K., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. Corn-put. 13, 2, 423-139 (1984).
8. Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Inf. Theor. 19, 21-31 (1985).
9. Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits and the polynomial time hierarchy. Math. Syst. Theory 17,13-27 (1984).
10. Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press (1988).
11. Goldschlager, L.: c-Productions in context-free grammars. Acta Informatica 16, 303-308 (1981).
12. He Jifeng: Process Simulation and Refinement. Formal Aspects of Computing 1,229-241 (1989).
13. Hoover, H.J., Ruzzo, W.L.: A Compendium of Problems Complete for P. Manuscript (1984).
14. Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18, 3, 625-638 (1989).
15. Kanellakis, P.C., Smolka, S. A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86, 202-241 (1990).
16. Karp, R., Ramachandran, V.: Parallel Algorithms for Shared Memory Machines. In: Handbook of Theoretical Computer Science, (vol A), 869-941, editor Jan Van Leeuwen, Elsevier (1990).
17. Keller, R.M.: Formal Verification of Parallel Programs. Comm. ACM, 19, 7, 371-384 (1976).
18. Mazurkiewicz, A: Basic notions of trace theory. Springer Verlag Lecture Notes in Computer Science 354, 285-363 (1989).
19. Milner, R.: A Calculus of Communicating Systems. Springer Verlag Lecture Notes in Computer Science 92 (1980).
20. Milner, R.: Communication and Concurrency. Prentice Hall (1989).
21. Milner, R.: A Complete Axiomatization for Observation Congruence of Finite-State Behaviours. Information and Computation.
22. Miyano, S., Shiraishi, S., Shoudai, T.: A list of P-complete problems. Technical Report RIFIS-TR-CS-17, Kyushu University 33, 1989.
23. Parberry, L: A primer on the complexity theory of neural networks. In: Formal techniques in artificial intelligence, R.B. Banerji (editor), North-Holland (1990).
24. Park, D.: Concurrency and Automata on Infinite Sequences. Springer Verlag Lecture Notes in Computer Science 104, 168-183 (1981).
25. Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall (1981).
26. Stockmeyer, L., Vishkin, U.: Simulation of parallel random access machines by circuits. SIAM J. Comput. 13, 2, 409-422 (1984).
27. Walker, D.J.: Automated Analysis of Mutual Exclusion Algorithms using CCS. Formal Aspects of Computing, 1, 273-292 (1989).