Parallel complexity in the design and analysis of concurrent systems-Reference-Cited by-同舟云学术

Parallel complexity in the design and analysis of concurrent systems

Published:1991 Issue: Volume: Page:288-303
ISSN:0302-9743
Container-title:Parle ’91 Parallel Architectures and Languages Europe
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-25209-3_20

Reference27 articles.

1. Aho, A., Hoperoft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1975).

2. Ajtai, M.: El-formulae on finite structures. Ann. Pure Appl. Logic 24, 1 - 48 (1983).

3. Alvarez, C., Gabarró, J.: The parallel complexity of two problems on concurrency. To appear at IPL.

4. Balcazar, J.L., Diaz, 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 LSI90-25, Universitat Politècnica de Catalunya. Submitted for publication.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Qualitative Logics and Equivalences for Probabilistic Systems;Logical Methods in Computer Science;2009-05-04

2. SERVICE-ORIENTED DESIGN: A MULTI-VIEWPOINT APPROACH;International Journal of Cooperative Information Systems;2004-12

3. On deciding some equivalences for concurrent processes;RAIRO - Theoretical Informatics and Applications;1994

4. A parallel algorithm for relational coarsest partition problems and its implementation;Computer Aided Verification;1994

5. Deciding true concurrency equivalences on finite safe nets (preliminary report);Automata, Languages and Programming;1993