×

A decidability theorem for a class of vector-addition systems. (English) Zbl 0302.68065


MSC:

68Q25 Analysis of algorithms and problem complexity
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68Q45 Formal languages and automata
Full Text: DOI

References:

[1] Karp, M. R.; Miller, R. E., Parallel program schemata, J. Comp. Syst. Sc., 3, 147-195 (1969) · Zbl 0198.32603
[2] Holt, A. W.; Commoner, F., Events and conditions, (Project MAC Conf. Concurrent Systems and Parallel Computation (1970), Woodshole: Woodshole Mass)
[3] Hack, M., The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems, 15th Annual Symp. on Switching and Automata Theory (1974), New Orleans
[4] S. Crespi-Reghizzi and D. Mandrioli, Petri nets and commutative grammars, Rept. N. 74-5; Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano.; S. Crespi-Reghizzi and D. Mandrioli, Petri nets and commutative grammars, Rept. N. 74-5; Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano. · Zbl 0354.68098
[5] Commoner, F., Marked directed graphs, J. Comp. Syst. Sc., 5, 511-523 (1971) · Zbl 0238.05109
[6] Ginsburg, S., The mathematical theory of context-free languages (1966), McGraw-Hill: McGraw-Hill New York · Zbl 0184.28401
[7] Hack, M., Analysis of Production schemata by Petri Nets, (MAC Tr-94 (1972), Massachussetts Institute of Technology)
[8] Hack, M., Decision problems for Petri Nets and Vector Addition Systems, (Computation Structures Group Memo (1974), Massachussetts Institute of Technology), 95-1
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.