Hardness of equivalence checking for composed finite-state systems (Q1015390): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00236-008-0088-x / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00236-008-0088-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2027782662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deciding bisimilarity is P-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2760238 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3777424 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4247261 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undecidability of bisimilarity by defender's forcing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4508303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity of a merge recognition problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three Partition Refinement Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of equivalence problems for concurrent systems of finite agents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: CONCUR 2003 - Concurrency Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3424633 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4818858 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484486 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of iterated shuffle / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00236-008-0088-X / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:01, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hardness of equivalence checking for composed finite-state systems |
scientific article |
Statements
Hardness of equivalence checking for composed finite-state systems (English)
0 references
8 May 2009
0 references
computational complexity
0 references
acyclic systems
0 references