Conference item icon

Conference item

Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States

Abstract:

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, +,

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
  • (Accepted manuscript, pdf, 546.7KB)
Publisher copy:
10.1109/LICS.2017.8005068

Authors


More by this author
Department:
Unknown
Role:
Author
Publisher:
Institute of Electrical and Electronics Engineers
Host title:
LICS 2017: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science
Journal:
LICS 2017: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science More from this journal
Publication date:
2017-08-18
Acceptance date:
2017-03-22
DOI:
ISSN:
1043-6871
Pubs id:
pubs:692252
UUID:
uuid:1362a013-35b8-4ca4-85fd-7744e9e2fba1
Local pid:
pubs:692252
Source identifiers:
692252
Deposit date:
2017-05-03

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP