scholarly journals Towards Certification of Autonomous Unmanned Aircraft Using Formal Model Checking and Simulation

Author(s):  
Matt Webster ◽  
Neil Cameron ◽  
Michael Jump ◽  
Michael Fisher
2014 ◽  
Vol 11 (5) ◽  
pp. 258-279 ◽  
Author(s):  
Matt Webster ◽  
Neil Cameron ◽  
Michael Fisher ◽  
Mike Jump

Author(s):  
Francesco Belardinelli ◽  
Panagiotis Kouvaros ◽  
Alessio Lomuscio

We introduce parameterised data-aware multi-agent systems, a formalism to reason about the temporal-epistemic properties of arbitrarily large collections of homogeneous agents, each operating on an infinite data domain. We show that their parameterised verification problem is semi-decidable for classes of interest. This is demonstrated by separately addressing the unboundedness of the number of agents and the the data domain. In doing so we reduce the parameterised model checking problem for these systems to that of parameterised verification for interleaved interpreted systems. We illustrate the expressivity of the formal model by modelling English auctions with an unbounded number of bidders on unbouded data and show how the technique here introduced can be used to give formal guarantees on the resulting system behaviour.


2014 ◽  
Vol 25 (3) ◽  
pp. 710-763 ◽  
Author(s):  
MASSIMO BARTOLETTI ◽  
PIERPAOLO DEGANO ◽  
GIAN LUIGI FERRARI ◽  
ROBERTO ZUNINO

We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity. We show that usage automata are expressive enough to model policies of real-world applications. We discuss their expressive power, and we prove that the problem of telling whether a computation complies with a usage policy is decidable. The main contribution of this paper is a model checking technique for usage automata. The model is that of usages, i.e. basic processes that describe the possible patterns of resource access and creation. In spite of the model having infinite states, because of recursion and resource creation, we devise a polynomial-time model checking technique for deciding when a usage complies with a usage policy.


Author(s):  
Fadi Wedyan ◽  
Reema Freihat ◽  
Suzan Wedyan ◽  
Hani Bani-Salameh ◽  
Hala Yousef

Author(s):  
Andrew J. Abbate ◽  
Ellen J. Bass

To support safe and effective human-system integration, a safety-critical system should be Complete, Understandable, Robust, Accurate, and Time efficient (CURATe) with respect to the user, interface, device, and environmental context. Using highly automated model checkers, researchers have shown that CURATe-related specifications can be verified early in the design process for a subset of system elements and interactions. This research introduces an extended model checking approach that aims to address all CURATe measures with respect to a broader range of human-integrated system elements: the interface, including documentation, configurable hardware, and control units; the user, including capabilities, actions, and knowledge; the device, including automation, actuators, and transducers; and the environment, including stimuli and constraints that could shape behavior. We describe a concept for what elements/interactions among them need to be modeled formally as well as a concept for applicable CURATe specifications. With respect to these concepts, we propose a formal model architecture and one temporal logic encoding for each CURATe specification.


2006 ◽  
Vol 17 (04) ◽  
pp. 885-901 ◽  
Author(s):  
ANSGAR FEHNKER ◽  
BRUCE KROGH

Though model checking itself is a fully automated process, verifying correctness of a hybrid system design using model checking is not. This paper describes the necessary steps, and choices to be made, to go from an informal description of the problem to the final verification result for a formal model and requirement. It uses an automotive control system for illustration.


Sign in / Sign up

Export Citation Format

Share Document