论文信息 - Persistence of vector replacement systems is decidable

Persistence of vector replacement systems is decidable

SummaryIn a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent or not, and if so, to construct a semilinear representation of the set of states reachable in the system.

Ernst W. Mayr

[1] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .

[2] Horst Müller. Decidability of Reachability in Persistent Vector Replacement Systems , 1980, MFCS.

[3] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[4] J. Berstel,et al. Context-free languages , 1993, SIGA.

[5] Michel Hack,et al. Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[6] Robert M. Keller. Vector replacement systems: a formalism for modelling asynchronous systems , 1972 .

[7] Richard J. Lipton,et al. Synchronization and computing capabilities of linear asynchronous structures , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8] Robert M. Keller,et al. A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

[9] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[10] Edward L. Robertson,et al. Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[11] Tadao Kasami,et al. Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets , 1977, Theor. Comput. Sci..

[12] Derek C. Oppen,et al. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..