Title :
Linear Algebraic Approach for Home Markings in Live and Bounded Equal Conflict Systems
Author_Institution :
Fac. of Comput. Sci., Al. I. Cuza Univ., Iasi, Romania
Abstract :
The paper proposes a linear algebraic based approach to finding a set of home markings in a bounded and live Equal Conflict System. Our algorithm is based on the theory of T-invariants, controlled-siphons and traps. The idea is to decompose the initial net in a certain subset of T-components, which are Choice-Free nets, find a set of live and potentially reversible markings for them and then compose these markings along the set of shared places. We also prove that the algorithm has NP complexity.
Keywords :
Petri nets; computational complexity; distributed processing; linear algebra; NP complexity; T-invariants theory; bounded equal conflict system; choice-free nets; controlled-siphons theory; home markings; linear algebra approach; live equal conflict system; traps theory; Complexity theory; Linear systems; Petri nets; Polynomials; Synchronization; System recovery; Vectors; Equal Conflict systems; Petri nets; home marking property; linear algebraic techniques;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4244-9816-1
DOI :
10.1109/SYNASC.2010.57
