Simulation Problems Over One-Counter Nets
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12157
- Type
- D - Journal article
- DOI
-
10.2168/LMCS-12(1:6)2016
- Title of journal
- Logical Methods in Computer Science
- Article number
- 6
- First page
- 1
- Volume
- 12
- Issue
- 1
- ISSN
- 1860-5974
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper combines and extends the conference papers "Simulation Over One-counter Nets is PSPACE-Complete" (FSTTCS 2013) and "Decidability of Weak Simulation on One-Counter Nets" (LICS 2013). The paper conclusively solves several open problems regarding the decidability, complexity and approximability status of strong and weak simulation preorders. These problems were open for 15 years and were first formulated by Abdulla and Cerans in "Simulation is decidable for one-counter nets" (CONCUR 1998).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -