NP-hardness of liveness problem of bounded asymmetric choice net

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 5, 2002, Pages 1071-1074

  Ohta, Atsushi ^a   Tsuji, Kohkichi ^a  

^a AICHI PREFECTURAL UNIVERSITY   (Japan)

Author keywords

Computational complexity; Concurrent system; Liveness; Petri net

Indexed keywords

BOOLEAN ALGEBRA; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING; VECTORS;

ASSYMETRIC CHOICE NET; BOOLEAN EXPRESSIONS; CONCURRENT SYSTEM; LIVENESS PROBLEM; POLYNOMIAL TIME;

PETRI NETS;

EID: 0036579149     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Letter

References (7)

1. Petri nets: Properties, analysis and applications
2. Complexity of some problems in Petri nets
3. A polynomial-time algorithm to decide liveness of bounded free choice nets
4. Structural theory of equal conflict systems
5. AC/DC-systems