Using Labeled Transition System Model in Software Access Control Politics Testing

2012 ◽  
Author(s):  
Hong Yu ◽  
Huang Song ◽  
Hu Bin ◽  
Yao Yi
Keyword(s):  
Access Control ◽  
Transition System ◽  
System Model ◽  
Labeled Transition System

Fuzzy Labeled Transition Refinement Tree

2014 ◽  
Vol 6 (3) ◽  
pp. 1-31 ◽  
Author(s):  
Sofia Kouah ◽  
Djamel-Eddine Saidouni
Keyword(s):  
Dynamic Systems ◽  
Transition System ◽  
System Model ◽  
Design Parameters ◽  
Concurrent Design ◽  
Incremental Development ◽  
Action Refinement ◽  
Formal Framework ◽  
Labeled Transition System ◽  
Multi Agents

This paper aims to provide a formal framework that supports an incremental development of dynamic systems such as multi agents systems (MAS). We propose a fuzzy labeled transition system model (FLTS for short). FLTS allows a concise action refinement representation and deals with incomplete information through its fuzziness representation. Afterward, based on FLTS model, we propose a refinement model called fuzzy labeled transition refinement tree (FLTRT for short). The FLTRT structure serves as a tree of potential concurrent design trajectories of the system. Also, we introduce bisimulation relations for both models in order to identify equivalent design trajectories, which could be assessed with respect to relevant design parameters.

scholarly journals A LTS Approach to Control in Event-B

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Han Peng ◽  
Chenglie Du ◽  
Lei Rao ◽  
Fu Chen
Keyword(s):  
Flow Model ◽  
State Machine ◽  
Transition System ◽  
Control Flow ◽  
Behavior Modeling ◽  
System Model ◽  
Behavior Model ◽  
System Behavior ◽  
Labeled Transition System ◽  
Event Trace

In Event-B, people need to use control variables to constrain the order of events, which is a time-consuming and error-prone process. This paper presents a method of combining labeled transition system and iUML-B to complete the behavior modeling of system, which is more convenient and practical for engineers who are accustomed to using the automaton to build a system behavior model. First, we use labeled transition system to establish the behavior model of the system. Then we simulate and verify the event traces of the labeled transition system behavior model. Finally, we convert labeled transition system model into iUML-B state machine and use it to generate the corresponding control flow model. We use Abrial’s bounded retransmission protocol to demonstrate the practicality of our approach. The simulation results show that the system behavior model generated by the iUML-B state machine has the same event trace as the corresponding labeled transition system model.

Fuzzy Labeled Transition Refinement Tree

Fuzzy Systems ◽  
2017 ◽  
pp. 873-905 ◽  
Author(s):  
Sofia Kouah ◽  
Djamel-Eddine Saidouni
Keyword(s):  
Incomplete Information ◽  
Dynamic Systems ◽  
Transition System ◽  
System Model ◽  
Design Parameters ◽  
Concurrent Design ◽  
Incremental Development ◽  
Action Refinement ◽  
Formal Framework ◽  
Labeled Transition System

This paper aims to provide a formal framework that supports an incremental development of dynamic systems such as multi agents systems (MAS). We propose a fuzzy labeled transition system model (FLTS for short). FLTS allows a concise action refinement representation and deals with incomplete information through its fuzziness representation. Afterward, based on FLTS model, we propose a refinement model called fuzzy labeled transition refinement tree (FLTRT for short). The FLTRT structure serves as a tree of potential concurrent design trajectories of the system. Also, we introduce bisimulation relations for both models in order to identify equivalent design trajectories, which could be assessed with respect to relevant design parameters.

Hierarchical Design Method for Multi-Agent Systems

2015 ◽  
Vol 7 (2) ◽  
pp. 105-134
Author(s):  
Bouneb Messaouda ◽  
Saïdouni Djamel Eddine
Keyword(s):  
Design Methodology ◽  
Design Method ◽  
Transition System ◽  
Hierarchical Design ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Labeled Transition System ◽  
System Assessment ◽  
Definition Of

This paper proposes a new hierarchical design method for the specification and the verification of multi agent systems (MAS). For this purpose, the authors propose the model of Refinable Recursive Petri Nets (RRPN) under a maximality semantics. In this model, a notion of undefined transitions is considered. The underlying semantics model is the Abstract Maximality-based Labeled Transition System (AMLTS). Hence, the model supports a definition of a hierarchical design methodology. The example of goods transportation is used for illustrating the approach. For the system assessment, the properties are expressed in CTL logic and verified using the verification environment FOCOVE (Formal Concurrency Verification Environment).

Application of Fuzzy Labeled Transition System to Contract Net Protocol

2015 ◽  
Vol 6 (3) ◽  
pp. 27-46 ◽  
Author(s):  
Sofia Kouah ◽  
Djamel Eddine Saïdouni
Keyword(s):  
Dynamic Systems ◽  
Transition System ◽  
Multi Agent Systems ◽  
Contract Net Protocol ◽  
Agent Systems ◽  
Contract Net ◽  
Multi Agent ◽  
Refinement Process ◽  
Labeled Transition System

For developing large dynamic systems in a rigorous manner, fuzzy labeled transition refinement tree (FLTRT for short) has been defined. This model provides a formal specification framework for designing such systems. In fact, it supports abstraction and enables fuzziness which allows a rigorous formal refinement process. The purpose of this paper is to illustrate the applicability of FLTRT for designing multi agent systems (MAS for short), among others collective and internal agent's behaviors. Therefore, Contract Net Protocol (CNP for short) is chosen as case study.

MODEL CHECKING OF COMPONENT BASED SOFTWARE USING COMPOSITIONAL REDUCTIONS

2008 ◽  
Vol 18 (05) ◽  
pp. 683-712 ◽  
Author(s):  
MOHAMMAD IZADI ◽  
ALI MOVAGHAR
Keyword(s):  
Model Checking ◽  
Composition Operators ◽  
Linear Time ◽  
Operational Semantics ◽  
Computing System ◽  
Transition System ◽  
Compositional Model ◽  
Temporal Properties ◽  
Labeled Transition System ◽  
Constraint Automata

A component-based computing system consists of two main parts: a set of components and a coordination subsystem. Reo is an exogenous coordination language for compositional construction of the coordination subsystem. Constraint automaton has been defined as the operational semantics of Reo. The main goal of this paper is to prepare a model checking method for verifying linear time temporal properties of component-based systems whose coordinating subsystems are modeled by Reo and components are modeled by labeled transition systems. For this purpose, we introduce modified definitions of constraint automata and their composition operators by which, every constraint automaton can be considered as a labeled transition system and each labeled transition system can be translated into a constraint automaton. We show that failure-based equivalences CFFD and NDFD are congruences with respect to the composition operators of constraint automata. Also we present a method for compositional model checking of component-based systems using these equivalences for reducing the sizes of constraint automata models.

scholarly journals An ECDSA Approach to Access Control in Knowledge Management Systems Using Blockchain

Information ◽  
2020 ◽  
Vol 11 (2) ◽  
pp. 111 ◽  
Author(s):  
Gabriel Nyame ◽  
Zhiguang Qin ◽  
Kwame Opuni-Boachie Obour Agyekum ◽  
Emmanuel Boateng Sifah
Keyword(s):  
Knowledge Management ◽  
Access Control ◽  
User Authentication ◽  
Knowledge Management System ◽  
System Model ◽  
Management Systems ◽  
Role Based Access Control ◽  
Blockchain Technology ◽  
Smart Contract ◽  
Role Based

Access control has become problematic in several organizations because of the difficulty in establishing security and preventing malicious users from mimicking roles. Moreover, there is no flexibility among users in the participation in their roles, and even controlling them. Several role-based access control (RBAC) mechanisms have been proposed to alleviate these problems, but the security has not been fully realized. In this work, however, we present an RBAC model based on blockchain technology to enhance user authentication before knowledge is accessed and utilized in a knowledge management system (KMS). Our blockchain-based system model and the smart contract ensure that transparency and knowledge resource immutability are achieved. We also present smart contract algorithms and discussions about the model. As an essential part of RBAC model applied to KMS environment, trust is ensured in the network. Evaluation results show that our system is efficient.

scholarly journals Real-Time System Modeling and Verification Through Labeled Transition System Analyzer

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 26314-26323
Author(s):  
Yilong Yang ◽  
Quan Zu ◽  
Wei Ke ◽  
Miaomiao Zhang ◽  
Xiaoshan Li
Keyword(s):  
Real Time ◽  
System Modeling ◽  
Transition System ◽  
Time System ◽  
Real Time System ◽  
Labeled Transition System

Computing crisp simulations for fuzzy labeled transition systems

2021 ◽  
pp. 1-12
Author(s):  
Linh Anh Nguyen
Keyword(s):  
Efficient Algorithm ◽  
Transition System ◽  
Worst Case ◽  
Transition Systems ◽  
Fuzzy Automata ◽  
Labeled Transition System ◽  
The Given ◽  
Naive Approach

The problem of checking whether a state in a finite fuzzy labeled transition system (FLTS) crisply simulates another is one of the fundamental problems of the theory of FLTSs. This problem is of the same nature as computing the largest crisp simulation between two finite FLTSs. A naive approach to the latter problem is to crisp the given FLTSs and then apply one of the currently known best methods to the obtained crisp labeled transition systems. The complexity of the resulting algorithms is of order O (l (m + n) n), where l is the number of fuzzy values occurring in the specification of the input FLTSs, m is the number of transitions and n is the number of states of the input FLTSs. In the worst case, l can be m + n and O (l (m + n) n) is the same as O ((m + n) 2 n). In this article, we design an efficient algorithm with the complexity O ((m + n) n) for computing the largest crisp simulation between two finite FLTSs. This gives a significant improvement. We also adapt our algorithm to computing the largest crisp simulation between two finite fuzzy automata.

Sign in / Sign up

Export Citation Format

Share Document