A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes-Reference-Cited by-同舟云学术

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes

Published:2003 Issue: Volume: Page:521-530
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2003
language:
Short-container-title:

Author:

Lasota Sławomir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45138-9_46

Reference26 articles.

1. Aceto, L.: History preserving, causal and mixed-ordering equivalence over stable event structures. Fundamenta Informaticae 17, 319–331 (1992)

2. Aceto, L.: Relating distributed, temporal and causal observations of simple processes. Fundamenta Informaticae 17, 369–397 (1992)

3. Balcázar, J., Gabarró, J., Sántha, M.: Deciding bisimilarity is P-complete. Formal Aspects of Computing 6A, 638–648 (1992)

4. M. Bednarczyk. Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences, Gdańsk (1991)

5. Lecture Notes in Computer Science;B. Bérard,2000

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

1. Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems;Lecture Notes in Computer Science;2015

2. Decidability of performance equivalence for basic parallel processes;Theoretical Computer Science;2006-08

3. Composition and Decomposition in True-Concurrency;Foundations of Software Science and Computational Structures;2005

4. Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP;Lecture Notes in Computer Science;2005