Skip to main content
Journal Article

A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2747 521-530
DOI: 10.1007/978-3-540-45138-9_46
8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A polynomial-time algorithm is presented to decide distributed bisimilarity of Basic Parallel Processes. As a direct conclusion, several other non-interleaving semantic equivalences are also decidable in polynomial time for this class of process, since they coincide with distributed bisimilarity. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Lasota, S. (2003). A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 521–530. https://doi.org/10.1007/978-3-540-45138-9_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free