Earticle

This study examines the factors influencing misinformation correction through fact-checking news using the elaboration likelihood model (ELM). A pretest-posttest experimental design was conducted with 502 Korean participants exposed to fact-checking news on a critical public health issue. By focusing on a non-Western context, this study expands fact-checking research beyond Western settings. To enhance ecological validity, a real-world stimulus?a fact-checking report aired on a major TV channel?was utilized. The study explores how motivational factors (need for cognition, issue involvement) and ability factors (news literacy, daily news consumption) influence elaborative processing and how elaboration mediates misinformation correction through attitude change. Additionally, it investigates the moderating effects of media-source credibility and political alignment between individual and the media source. Findings indicate that elaboration significantly mediates the relationship between not only issue involvement (motivational factor) but also news literacy (ability factor) and misinformation correction. However, these mediation effects weaken as political alignment diverges, reducing the efficacy of elaboration. These results contribute to a deeper understanding of the theoretical implications of the ELM in the context of misinformation correction through fact-checking news and suggest practical strategies to enhance the effectiveness of fact-checking interventions in politically polarized environments.

Modeling and verification of behavioral variability in service-oriented product line descriptions is very important. Time is a pivotal parameter in representing behaviors of services, which is difficult for scalable modeling and efficient automated checking. In this paper, we describe an approach for modeling and efficient verification of service-oriented product lines. Firstly, we propose feature timed automata, formalism designed to describe the combined behavior of a timed service family, which leverages on establishing relationships between features and transitions. Then, we present feature computation tree logic to model timed properties of service families, which extend computation tree logic to take into account the products constraints. Finally, using our methodology, we analyze a travel agency service family using the model checker UPPAAL. The experiment shows that our approach helps to verify timed service families effectively in the early phases of development.

In recent years, the modeling and verifying of Cyber-Physical System (CPS) is now an important aspect of CPS researches. Because of the CPS’ complex architecture, it may suffer from the state-space explosion problem when we verify CPS models by model checking methods. Therefore, we offer a method which models CPS with Component Services. The method treats the CPS components as a service provider, and models component services to further simplify the system’s state-space. We verify the correctness of this model and solve the synchronous/asynchronous communication problems.

With the wide application of probabilistic systems, the research of counterexample generation for probabilistic system with model checking has attracted wide attention. For counterexample of complex parametric system, proposes a counterexample generation algorithm for multiple until constraint formulae of probabilistic computation tree logic act on continuous time probabilistic model and gives another counterexample computation method based on automaton theory. At last, the example analysis is given. The theoretical analysis and example result show that the feasibility and validity of the method.

In view of the web service model checking application, the combination mode of traditional finite state machines cannot guarantee the correctness of Web composite service. A web service model diction algorithm of non-centralized automaton based on satisfiability modulo theories (SMT) is proposed. First, SMT is used for bounded model checking of time automaton, and the time automaton model is directly converted into logical formula that can be identified by SMT, to make solution; secondly, the proposed SMT time automaton theory is used to achieve the employee travel arrangements web services for modeling and verification; finally, through an example analysis, the effectiveness of the algorithm on the termination of the path deadlock and the optimization of network parameters.

Virtually all control systems nowadays perform various behavioral aspects such as discrete control mode transformation and continuous real time behavior. The interaction of these different types of dynamics and information leads to a lot of safety and control problems. In this paper, to verify these systems we propose a specification model combining interface automata, initialized multirate hybrid automata and Z language, named MZIA. This model can be used to describe temporal properties, hybrid properties, and data properties of hybrid software/hardware complements. And then, we propose a temporal logic for MZIA. Next, considering the measuring errors of real-numbered variables in practice, we study the approximated model checking method of MZIA. Finally, an example is given to indicate that this method is feasible and effective.

Model checking has proven to be a successful technology to verify real-time embedded and safety-critical systems. However an application of model checking in practice still requires manual construction of an environment model, which has a direct impact on verification cost. This paper suggests an automated scenario generation technique through a property-based static analysis of function-call relationship of the program source code. We present the scenario generation process and show application results on the Trampoline operating system using CBMC as a back-end model checker. The experimental result shows that our approach is able to reduce the verification cost significantly in terms of memory space and run time.

Many ontology-based methods have been proposed and applied in order to elicit system requirements correctly and unambiguously. However, most of ontologies in these methods are purely conceptual models. Furthermore, the domain knowledge base only captures domain concepts and neglects domain-restricted rules. If the requirements model violate these rules or contradict the usual business behavior, they become unreasonable. This paper suggests a formal approach to precisely describe ontology using description logic at first, and then model the integrity rules and derivation rules which restrict the business behavior. All the rules are represented in three aspects: syntax, semantics and visualization. Finally, the requirements model checking framework is provided combining domain ontology and domain rules, which makes the requirements elicitation process both guided by domain ontology and restricted by domain rules. Therefore, the acquired requirements would comply with both business needs and domain knowledge.

This paper presents a case study for symbolic model checking (SMC) with Propositional Projection Temporal Logic (PPTL). First, PPTL is briefly introduced. Then an outline of symbolic model checking algorithm for PPTL proposed in [21] is presented. As a case study, a single-track railroad crossing control system (STRCCS) is employed to illustrate how SMC for PPTL can be utilized in the specification and verification of embedded real-time systems.

Model-Driven Engineering (MDE) tries to reduce the effort spent on software development by generating codes from models. People concentrate their minds on the transformation between models and models, or between models and codes. People also concentrate on checking consistency between different models such as consistency between a class diagram and a sequence diagram and consistency between a sequence diagram and a state machine diagram. Checking relationship consistency and class redundancy in a class model is still important but ignored in recent years. This paper concentrates on relationship problems between classes in a class diagram and proposes methods of checking various relationship problems. We address the redundancy of a class’s operations and attributes. We identify a large range of the problems for class diagram. Our research is based on the relationship abstraction rules.

객체지향 환경에서 복잡한 소프트웨어 시스템을 개발하기 위해서는, 그것의 복잡성과 대규모성 때문에 추상화에 의한 다계층적인 use case model 의 사용이 불가피하다. 이러한 경우 모델의 consistency 유지가 매우 주요하고 어려운 이슈가 된다. 본 논문에서는 각 추상화 단계에 따른 use case model 들 사이에서 자동적으로 형식적인 consistency 를 체킹할 수 있는 방법을 제안한다. 이 접근 방법은 rule 을 기반으로 하여 actor tree, use cose composition diagram를 use case description을 활용한다. 본 접근법을 검증하기 위하여, ITS 아키텍처 (Intelligent Transportation System architecture)의 한 파트를 예로 들어 적용하였다.

This paper considers a specification test of conditional Poisson regression model for time series count data. Although conditional models for count data have received attention and proposed in several ways, few studies focused on checking its adequacy. Motivated by the test of martingale difference assumption, a specification test via Ljung-Box statistic is proposed in the conditional model of the time series count data. In order to illustrate the performance of Ljung- Box test, simulation results will be provided.

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modification to the basic region abstraction method to be used specially for computing the state space of TPN models, so that the number of regions becomes smaller than that of the situations in which the current methods are applied. The proposed approach is based on the special features of TPN that helps us to construct suitable and small region graphs that preserve the time properties of TPN. To achieve this, we use TPN-TCTL as a timed extension of CTL for specifying a subset of properties in TPN models. Then, for model checking TPN-TCTL properties on TPN models, CTL model checking is used on TPN models by translating TPN-TCTL to the equivalent CTL. Finally, we compare our proposed method with the current region-based abstraction methods proposed for TPN models in terms of the size of the resulting region graph.

Ensuring the reliability and safety of safety-critical systems within nuclear power plant hinges upon efficient failure effects analysis. Conventional approaches to failure effects analysis in reactor protection systems encounter notable challenges, including labor-intensive manual analysis and limitations in ensuring comprehensive analysis coverage. To tackle these issues head-on, we introduce a novel methodology termed Failure Effects Analysis on Safety Properties (FEA-SP). Grounded in model checking technology, this method facilitates automated failure analysis processes. By harnessing the exhaustive state space exploration capabilities inherent in model checking, the FEA-SP methodology adopts the safety properties of the system as its granularity and verification focal point. A detailed component-level case study involving a hard logic within the HPR1000 nuclear reactor protection system underscores the efficacy and practicality of the proposed approach, especially in the thorough examination of system spurious actions. The failure effects analysis method delineated in this paper holds broad applicability and serves as a valuable reference for the analysis of failure effects in safety systems.

In this paper we propose a model for checking integrity constraints of mobile databases called Three-Level (3-L) model, wherein the process of constraint checking to maintain the consistent state of mobile databases is realized at three different levels. Sufficient and complete tests proposed in the previous works together with the idea of caching relevant data items for checking the integrity constraints are adopted. This has improved the checking mechanism by preventing delays during the process of checking constraints and performing the update. Also, the 3-L model reduces the amount of data accessed given that much of the tasks are performed at the mobile host, and hence speeds up the checking process.

In the development of complex software system, it is important to use hierarchical use case model due to the complex scope of development procedure. The use case model is core factor of the OMG (Object Management Group)'s UML (Unified Modeling Language) diagrams. In this paper, we propose a novel method to check syntactic consistency automatically in use case models at the different level of abstraction. This method is a rule-based approach which utilizes actor tree, use case tree and use case description. The proposed method is simulated on ITS (Intelligent Transportation System) architecture for the verification.

Background: To compare the KKU-model rectal tube (KKU-tube) and the conventional rectal tube (CRT) for checking rectal doses during high-dose-rate intracavitary brachytherapy (HDR-ICBT) of cervical cancer. Materials and Methods: Between February 2010 and January 2011, thirty -two patients with cervical cancer were enrolled and treated with external beam radiotherapy (EBRT) and intracavitary brachytherapy (ICBT). The KKU-tube and CRT were applied intrarectally in the same patients at alternate sessions as references for calculation of rectal doses during ICBT. The gold standard references of rectum anatomical markers which are most proximal to radiation sources were anterior rectal walls (ARW) adjacent to the uterine cervix demonstrated by barium sulfate suspension enema. The calculated rectal doses derived from actual anterior rectal walls, CRT and the anterior surfaces of the KKU-tubes were compared by using the paired t-test. The pain caused by insertion of each type of rectal tube was assessed by the visual analogue scale (VAS). Results: The mean dose of CRT was lower than the mean dose of ARW ($Dmean_0-Dmean_1$) by $80.55{\pm}47.33cGy$ (p-value <0.05). The mean dose of the KKU-tube was lower than the mean dose of ARW ($Dmean_0-Dmean_2$) by $30.82{\pm}24.20cGy$ (p-value <0.05). The mean dose difference [($Dmean_0-Dmean_1$)-($Dmean_0-Dmean_2$)] was $49.72{\pm}51.60cGy$, which was statistically significant between 42.32 cGy -57.13 cGy with the t-value of 13.24 (p-value <0.05). The maximum rectal dose by using CRT was higher than the KKU-tube as much as 75.26 cGy and statistically significant with the t-score of 7.55 (p-value <0.05). The mean doses at the anterior rectal wall while using the CRTs and the KKU-tubes were not significantly different (p-value=0.09). The mean pain score during insertion of the CRT was significantly higher than the KKU-tube by a t-score of 6.15 (p-value <0.05) Conclusions: The KKU-model rectal tube was found to be an easily producible, applicable and reliable instrument as a reference for evaluating the rectal dose during ICBT of cervical cancer without negative effects on the patients.

하드웨어 검증에서 성공적으로 적용되었던 모델 검증 기법을 소프트웨어 검증에 활용하는 연구가 활발하다. 이러한 연구 중의 하나가 바운디드 모델 검증이다. 바운디드 모델 검증에서는 모델이 갖는 상태 공간을 한꺼번에 모두 탐색하기보다는 모델의 탐색 범위를 점진적으로 넓혀가면서 에러를 찾는다. 본 논문에서는 이러한 바운디드 모델 검증을 이용하여 BOGOR의 입력 언어인 BIR를 검증하였다. 그 결과 BOGOR에서 제공되는 명시적 모델 검증 기능 보다 우수한 성능을 보였다. 본 논문에서는 BIR 언어를 CNF 논리식으로 변환하는 방법과 단계적 절차를 기술한다.

Model checking has been successfully applied to hardware verification. Software is more subtle than hardware with respect to formal verification due to its infinite state space. Although there are many research activities in this area, bounded model checking is regarded as a promising technique. Bounded model checking uses an upper bound to unroll its model, which is the main advantage of bounded model checking compared to other model checking techniques. In this paper, we applied bounded model checking to verify BIR which is the input model for the model checking tool BOGOR. Some BIR examples are verified with our technique. Experimental results show that bounded model checking is better than explicit model checking provided by BOGOR. This paper presents the formalization of BIR and the encoding algorithm of BIR into CNF.

하드웨어 개발에 있어서 데이터의 신속한 처리와 공정의 저렴한 비용을 위해 회로의 많은 부분이 게이트 레벨에서 구현된다. 기능 검사는 하드웨어 개발에 있어서 설계의 기능을 분석하는 중요한 설계 흐름이다. 기존의 기능 검사는 사용자의 요구에 의해 하드웨어 시스템이 복잡해지고 개발 주기가 점점 빨라지는 시장의 특성으로 인해 설계자에게 시간적 경제적인 부담감을 준다. 본 연구에서는 설계자에게 가중되는 부담을 극복하고 보다 효율적인 기능 검사를 위해 모델 체킹을 동치성 검사에 적용하는 방법을 제안하고자 한다.