Model Checking a Logic for True Concurrency

2020 ◽  
Vol 21 (4) ◽  
pp. 1-49
Author(s):  
Paolo Baldan ◽  
Tommaso Padoan
Keyword(s):  
Model Checking ◽  
True Concurrency

True Concurrency Semantics

2014 ◽  
Vol 5 (2) ◽  
pp. 22-42 ◽  
Author(s):  
Souad Guellati ◽  
Ilham Kitouni ◽  
Riad Matmat ◽  
Djamel-Eddine Saidouni
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Timed Automata ◽  
Model Data ◽  
True Concurrency ◽  
New Class ◽  
Computation Tree ◽  
Interleaving Semantics ◽  
Finite State ◽  
Validation Technique

The model checking algorithms have been widely studied for timed automata, it's a validation technique for automatically verifying correctness properties of finite-state systems, which are based on interleaving semantics. Therefore the actions are assumed instantaneous. To overcome the hypothesis of temporal and structural atomicity of actions, we use the durational actions timed automata model (daTA). This model is based on the maximality semantics. Properties to be verified are expressed using the Timed Computation Tree Logic (TCTL). For dealing with formal verification, the Maximality-based Region Graph (MRG) is defined and an adaptation of the model checking algorithm is proposed. The use of the maximality semantics based verification provides new class of properties related to simultaneous progress of actions at different states.

Model-Checking of Infinite Graphs Defined by Graph Grammars

2000 ◽  
Vol 5 ◽  
pp. 1 ◽  
Author(s):  
O BURKART ◽  
Y QUEMENER
Keyword(s):  
Model Checking ◽  
Infinite Graphs ◽  
Graph Grammars

Towards the improvement of model checking

2014 ◽  
Author(s):  
Peiyu Huang
Keyword(s):  
Model Checking

Model Checking Control Software for Nonlinear Dynamic Systems

2008 ◽  
Author(s):  
James Kapinski ◽  
Alexandre Donze ◽  
Flavio Lerda ◽  
Hitashyam Maka ◽  
Edmund Clarke ◽  
...  
Keyword(s):  
Model Checking ◽  
Dynamic Systems ◽  
Nonlinear Dynamic ◽  
Nonlinear Dynamic Systems ◽  
Control Software

REQUIREMENT FORMALIZATION FOR MODEL CHECKING USING EXTENDED BACKUS NAUR FORM

2019 ◽  
Vol 13 (3) ◽  
pp. 1
Author(s):  
ALIYU E. O. ◽  
ADEWALE O. S. ◽  
ADETUNMBI A. O. ◽  
OJOKOH B. A. ◽  
◽  
...  
Keyword(s):  
Model Checking

Perkembangan Bahasa Anak Usia 12 Hingga 24 Bulan di Semarang

2018 ◽  
Vol 1 (2) ◽  
pp. 66
Author(s):  
Marini Marini ◽  
Khasanah Khasanah
Keyword(s):  
Data Analysis ◽  
Data Collection ◽  
Model Checking ◽  
Language Development ◽  
Qualitative Method ◽  
Questionnaire Data ◽  
Daily Lives ◽  
Analysis Techniques ◽  
Development Of Language

Abstract The  problem  of this research is : How is the language development of children age 12 to 24 months in Semarang ?. The purpose of this study is to describe widely and deeply about language development the children age 12 to 24 in Semarang. The method used in this research is qualitative method. Data collection is done by observation, interviews, and questionnaire. Data analysis techniques using Miles Hubermen’s model. Checking the validity of the data using triangulation data. The results showed that the development of language of children aged 12 to 24 months in Semarang in expressive is: can produce sound almost perfect in several words; Some of the letters of the words missing from the pronunciation; The missing letters are usually consonants; Haven't been able to pronounce the letter s and r; In General, most people are able to understand the speech of the children is an adult who is close to the child; There is a word that can be spelled perfectly by the child. The words are by and large is the words that are simple and close to the children's daily lives. As for the generally receptive: children can follow and obey what is spoken by adults; The children seem to understand when the adults were talking about them; and children  can understand  to the words that they  heard more than that they can speak.   Keywords: Language, children, expressive, receptive, word.    

Sign in / Sign up

Export Citation Format

Share Document