activity
20132019
most citedVerification of Logical Consistency in Robotic Reasoning

7 citations · 18 across the 8 of their papers we have counts for

collaborators

8 papers

eess.SY2019★ 1 cited

Online Observability of Boolean Control Networks

Guisen Wu, Liyun Dai, Zhiming Liu +2

Observabililty is an important topic of Boolean control networks (BCNs). In this paper, we propose a new type of observability named online observability to present the sufficient…

q-bio.MN2017★ 1 cited

Taming Asynchrony for Attractor Detection in Large Boolean Networks (Technical Report)

Andrzej Mizera, Jun Pang, Hongyang Qu +1

Boolean networks is a well-established formalism for modelling biological systems. A vital challenge for analysing a Boolean network is to identify all the attractors. This becomes…

cs.GT2016

SMCL - Stochastic Model Checker for Learning in Games

Hongyang Qu, Michalis Smyrnakis, Sandor M. Veres

A stochastic model checker is presented for analysing the performance of game-theoretic learning algorithms. The method enables the comparison of short-term behaviour of learning a…

cs.RO2016

A stochastically verifiable autonomous control architecture with reasoning

Paolo Izzo, Hongyang Qu, Sandor M. Veres

A new agent architecture called Limited Instruction Set Agent (LISA) is introduced for autonomous control. The new architecture is based on previous implementations of AgentSpeak a…

cs.RO2016

Testing, Verification and Improvements of Timeliness in ROS processes

Mohammed Y. Hazim, Hongyang Qu, Sandor M. Veres

This paper addresses the problem of improving response times of robots implemented in the Robotic Operating System (ROS) using formal verification of computational-time feasibility…

cs.RO2016★ 7 cited

Verification of Logical Consistency in Robotic Reasoning

Hongyang Qu, Sandor M. Veres

Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the…

eess.SY2016★ 4 cited

Reducing complexity of autonomous control agents for verifiability

Paolo Izzo, Hongyang Qu, Sandor M. Veres

The AgentSpeak type of languages are considered for decision making in autonomous control systems. To reduce the complexity and increase the verifiability of decision making, a lim…

cs.LO2013★ 5 cited

Reasoning about Strategies under Partial Observability and Fairness Constraints

Simon Busard, Charles Pecheur, Hongyang Qu +1

A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unifi…