A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
Bookmark
ShareCopied to clipboardA polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes is a book. It was written by Yoram Hirshfeld and published by LFCS, Dept. of Computer Science, University of Edinburgh in 1994.
Key facts
- author: Yoram Hirshfeld
- publication date: 1994
- book publisher: LFCS, Dept. of Computer Science, University of Edinburgh
- book series: LFCS report series
- book subjects: Algorithms, Parallel processing (Electronic computers), Polynomials
See more factsExtract data
Download datasets about A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes:
Dataset of books series that contain A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes:
Dataset of book subjects that contain A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes:
"A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes" is one of the books by Yoram Hirshfeld, books by LFCS, Dept. of Computer Science, University of Edinburgh and 2,617,384 books in our database.
Related
Connected or similar to A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes: .
This dashboard is based on data from: The British Library.
This content is available under the CC BY 4.0 license.