scholarly journals A verified model checker for the modal Μ-calculus in Coq

1998 ◽  
pp. 167-183 ◽  
Author(s):  
Christoph Sprenger
Keyword(s):  
Model Checker

scholarly journals Verification and Strategy Synthesis for Coalition Announcement Logic

2021 ◽  
Author(s):  
Natasha Alechina ◽  
Hans van Ditmarsch ◽  
Rustam Galimullin ◽  
Tuo Wang
Keyword(s):  
Model Checking ◽  
Proof Of Concept ◽  
Model Checker ◽  
Complete Model ◽  
Concept Model ◽  
The Family ◽  
Winning Strategies ◽  
Epistemic Goals

AbstractCoalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

scholarly journals Hybrid Verification Technique for Decision-Making of Self-Driving Vehicles

2021 ◽  
Vol 10 (3) ◽  
pp. 42
Author(s):  
Mohammed Al-Nuaimi ◽  
Sapto Wibowo ◽  
Hongyang Qu ◽  
Jonathan Aitken ◽  
Sandor Veres
Keyword(s):  
Decision Making ◽  
Autonomous Vehicle ◽  
Autonomous Driving ◽  
Practical Implementation ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Time Operation ◽  
Bdi Agent ◽  
Perception System ◽  
Probability Of Success

The evolution of driving technology has recently progressed from active safety features and ADAS systems to fully sensor-guided autonomous driving. Bringing such a vehicle to market requires not only simulation and testing but formal verification to account for all possible traffic scenarios. A new verification approach, which combines the use of two well-known model checkers: model checker for multi-agent systems (MCMAS) and probabilistic model checker (PRISM), is presented for this purpose. The overall structure of our autonomous vehicle (AV) system consists of: (1) A perception system of sensors that feeds data into (2) a rational agent (RA) based on a belief–desire–intention (BDI) architecture, which uses a model of the environment and is connected to the RA for verification of decision-making, and (3) a feedback control systems for following a self-planned path. MCMAS is used to check the consistency and stability of the BDI agent logic during design-time. PRISM is used to provide the RA with the probability of success while it decides to take action during run-time operation. This allows the RA to select movements of the highest probability of success from several generated alternatives. This framework has been tested on a new AV software platform built using the robot operating system (ROS) and virtual reality (VR) Gazebo Simulator. It also includes a parking lot scenario to test the feasibility of this approach in a realistic environment. A practical implementation of the AV system was also carried out on the experimental testbed.

A Node-Style Visual Programming Environment for the nuXmv Model Checker

2020 ◽  
Author(s):  
Hayato Naito ◽  
Tomoyuki Yokogawa ◽  
Nao Igawa ◽  
Sousuke Amasaki ◽  
Hirohisa Aman ◽  
...  
Keyword(s):  
Visual Programming ◽  
Programming Environment ◽  
Model Checker

scholarly journals On-the-fly Workload Prediction and Redistribution in the Distributed Timed Model Checker Zeus

2005 ◽  
Vol 128 (3) ◽  
pp. 3-18 ◽  
Author(s):  
V. Braberman ◽  
A. Olivero ◽  
F. Schapachnik
Keyword(s):  
Model Checker ◽  
Workload Prediction

VERIS: An Efficient Model Checker for Synchronous VHDL Designs

2001 ◽  
pp. 97-107
Author(s):  
Yiping Fan ◽  
Jinsong Bei ◽  
Jinian Bian ◽  
Hongxi Xue ◽  
Xianlong Hong ◽  
...  
Keyword(s):  
Model Checker

Borealis Bounded Model Checker: The Coming of Age Story

2017 ◽  
pp. 119-137 ◽  
Author(s):  
Marat Akhin ◽  
Mikhail Belyaev ◽  
Vladimir Itsykson
Keyword(s):  
Coming Of Age ◽  
Model Checker

MODEL CHECKING FOR VERIFICATION OF MANDATORY ACCESS CONTROL MODELS AND PROPERTIES

2011 ◽  
Vol 21 (01) ◽  
pp. 103-127 ◽  
Author(s):  
VINCENT C. HU ◽  
D. RICHARD KUHN ◽  
TAO XIE ◽  
JEEHYUN HWANG
Keyword(s):  
Access Control ◽  
Test Cases ◽  
Covering Array ◽  
Model Checker ◽  
Challenging Problem ◽  
Automated Generation ◽  
Mandatory Access Control ◽  
Access Control Models ◽  
Security Properties ◽  
Property Verification

Mandatory access control (MAC) mechanisms control which users or processes have access to which resources in a system. MAC policies are increasingly specified to facilitate managing and maintaining access control. However, the correct specification of the policies is a very challenging problem. To formally and precisely capture the security properties that MAC should adhere to, MAC models are usually written to bridge the rather wide gap in abstraction between policies and mechanisms. In this paper, we propose a general approach for property verification for MAC models. The approach defines a standardized structure for MAC models, providing for both property verification and automated generation of test cases. The approach expresses MAC models in the specification language of a model checker and expresses generic access control properties in the property language. Then the approach uses the model checker to verify the integrity, coverage, and confinement of these properties for the MAC models and finally generates test cases via combinatorial covering array for the system implementations of the models.

Sign in / Sign up

Export Citation Format

Share Document