Bisimilarity in Fresh-Register Automata
- Submitting institution
-
Queen Mary University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 427
- Type
- E - Conference contribution
- DOI
-
10.1109/lics.2015.24
- Title of conference / published proceedings
- 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
- First page
- 156
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2015
- 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
-
2
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper fully classified the complexity of the equivalence problem (bisimilarity) for finite-state machines over infinite alphabets, a problem that had remained open since the introduction of mobile (nominal) abstract machines such as register automata and the pi-calculus. The algorithms developed led to subsequent extensions and the implementation of a polynomial-time equivalence checker for register automata (Mathematical Foundations of Computer Science 2018, Automated Technology for Verification and Analysis 2019), a breakthrough improvement over the previous, exponential time, attempts. These algorithms form part of a grant application in preparation with Trinity College Dublin, on regression verification in codebase updates.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -