State space reduction using partial order techniques (Q1856177): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s100090050035 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s100090050035 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999288406 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S100090050035 / rank | |||
Normal rank |
Latest revision as of 10:30, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | State space reduction using partial order techniques |
scientific article |
Statements
State space reduction using partial order techniques (English)
0 references
1999
0 references
With the advancement of computer technology, highly concurrent systems are being developed. The verification of such systems is a challenging task, as their state space grows exponentially with the number of processes. Partial order reduction is an effective technique to address this problem. It relies on the observation that the effect of executing transitions concurrently is often independent of their ordering. In the paper we present the basic principles behind partial order reduction and its implementation.
0 references
state space reduction
0 references
partial order reduction
0 references