Pratt [13] introduced POMSETs (partially ordered multisets) in order to describe and analyze concurrent systems. A POMSET P gives a set of temporal constraints that any correct execution of a given concurrent system must satisfy. Let L(P) (the language of P) denote the set of all system executions that satisfy the constraints given by P. We show the following for finite POMSETs P, Q, and system execution x.
•
The POMSET Language Membership Problem (given x and P, is x e L(P)?) is NP-complete.
•
The POMSET Language Containment Problem (given P and Q, is L(P) ⊑L(Q)?) is II2p-complete.
•
The POMSET Language Equality Problem (given P and Q, is L(P) = L(Q)7) is at least as hard as the graph-isomorphism problem.
•
The POMSET Language Size Problem (given P, how many x are in L(P)?) is span-P-complete.
[1]
Edmund M. Clarke,et al.
Reasoning about Networks with Many Identical Finite State Processes
,
1989,
Inf. Comput..
[2]
Leslie G. Valiant,et al.
The Complexity of Computing the Permanent
,
1979,
Theor. Comput. Sci..
[3]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[4]
Jacobo Torán,et al.
On Counting and Approximation
,
1988,
CAAP.
[5]
Pierre Wolper,et al.
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic
,
1987,
Theor. Comput. Sci..