Counter Automata: Verification and Synthesis

计数器自动机：验证与综合

• 批准号: EP/M011801/1
• 负责人: Ranko Lazic
• 金额: $ 29.21万
• 依托单位: University of Warwick
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2015
• 资助国家: 英国
• 起止时间: 2015 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FM011801%2F1
• 关键词: Counter; Automata; Verification; Synthesis

Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.

目前GtR中并没有所有资助研究的摘要。这通常是因为在提交提案时不需要摘要，但也可能是因为摘要中包含个人详细信息等敏感信息。

项目成果

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems

定时寄存器下推自动机和分支向量加法系统的二进制可达性

• DOI: 10.1145/3326161
• 发表时间: 2019
• 期刊: ACM Transactions on Computational Logic
• 影响因子: 0.5
• 作者: Clemente L

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

具有状态的二维一元向量加法系统的可达性是 NL 完全的

• DOI: 10.1145/2933575.2933577
• 发表时间: 2016
• 作者: Englert M

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One

• DOI: 10.4230/lipics.icalp.2017.119
• 发表时间: 2017-04
• 作者: Diego Figueira;R. Lazic;Jérôme Leroux;Filip Mazowiecki;G. Sutre

Pumping lemmas for weighted automata

加权自动机的泵送引理

• DOI: 10.46298/lmcs-17(3:7)2021
• 发表时间: 2021
• 期刊: Logical Methods in Computer Science
• 影响因子: 0.6
• 作者: Chattopadhyay A

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One

一维分支VASS可达性多项式时间算法

• 发表时间: 2016
• 作者: Goeller S