Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
This paper studies sets of rational numbers definable by continuous Petri nets and extensions thereof. First, we identify a polynomial-time decidable fragment of existential FO(Q, +, <) and show that the sets of rationals definable in this fragment coincide with reachability sets of continuou...
| Main Authors: | , |
|---|---|
| 格式: | Conference item |
| 出版: |
Institute of Electrical and Electronics Engineers
2017
|