In the contribution we show some liveness and boundedness knowledge in asymmetric choice nets (ACN) which could be a practical model for distributed systems and is more powerful than free choice nets, including the necessary and sufficient condition for an asymmetric net system being live and bounded, and an algorithm, polynomial time complexity, for such deciding. Also two theorems about a subclass of ACN are in the paper.
展开▼
