Automata Theory and Model Checking

2018 ◽  
pp. 107-151 ◽  
Author(s):  
Orna Kupferman
Keyword(s):  
Model Checking ◽  
Automata Theory ◽  
Theory And Model

Automata theory and higher-order model-checking

2016 ◽  
Vol 3 (4) ◽  
pp. 13-31 ◽  
Author(s):  
Igor Walukiewicz
Keyword(s):  
Model Checking ◽  
Higher Order ◽  
Automata Theory ◽  
Order Model

Formal and computational verification of phonological analyses

Phonology ◽  
2017 ◽  
Vol 34 (2) ◽  
pp. 407-435 ◽  
Author(s):  
Mans Hulden
Keyword(s):  
Model Checking ◽  
Case Studies ◽  
Automata Theory ◽  
Practical Case ◽  
Selection Of

This article presents a selection of methods to analyse, compare, verify and formally prove properties about phonological generalisations. Drawing from both well-known and recent results in the domains of model checking and automata theory, a useful methodology for automating the task of comparing analyses and inventing counterexamples is explored. The methods are illustrated by practical case studies that are intended to both resolve concrete issues and be representative of typical techniques and results.

scholarly journals Modeling and Verification of ARINC 653 Hierarchical Preemptive Scheduling

2019 ◽  
Vol 17 (1) ◽  
pp. 99-106 ◽  
Author(s):  
Ning Fu ◽  
Lijun Shan ◽  
Chenglie Du ◽  
Zhiqiang Liu ◽  
Han Peng
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Automata Theory ◽  
Traditional Scheduling ◽  
Preemptive Scheduling ◽  
Scheduling System ◽  
Software Interface ◽  
Precise Analysis ◽  
Stop Watch ◽  
Automata Network

Avionics Application Standard Software Interface (ARINC 653) is a software specification for space and time partitioning in safety-critical avionics real-time operating systems. Correctly designed task schedulers are crucial for ARINC 653 running systems. This paper proposes a model-checking-based method for analyzing and verifying ARINC 653 scheduling model. Based on priced timed automata theory, an ARINC 653 scheduling system was modeled as a priced timed automata network. The schedulability of the system was described as a set of temporal logic expressions, and was analyzed and verified by a model checker. Our research shows that it is feasible to use model checking to analyze task schedulability in an ARINC 653 hierarchical scheduling system. The method discussed modeled preemptive scheduling by using the stop/watch features of priced timed automata. Unlike traditional scheduling analysis techniques, the proposed approach uses an exhaustive method to automate analysis of the schedulability of a system, resulting in a more precise analysis

Sign in / Sign up

Export Citation Format

Share Document