Formal Verification of Lack of Existence of Illegal Scenarios in the Requirements of Distributed Systems

AbstractAutomated verification of distributed systems becomes very important in distributed computing. The graphical insight into the system in the early and late stages of the project is essential. In the design phase, the visual input helps to articulate the collaborative distributed components clearly. The formal verification gives evidence of correctness or malfunction, but in the latter case, graphical simulation of counterexample helps for better understanding design errors. For these purposes, we invented Distributed Autonomous and Asynchronous Automata (DA3), which have the same semantics as the formal verification base—Integrated Model of Distributed Systems (IMDS). The IMDS model reflects the natural characteristics of distributed systems: unicasting, locality, autonomy, and asynchrony. Distributed automata have all of these features because they share the same semantics as IMDS. In formalism, the unified system definition has two views: the server view of the cooperating distributed nodes and the agent view of the migrating agents performing distributed computations. The automata have two formally equivalent forms that reflect two views: Server DA3 for observing servers exchanging messages, and Agent DA3 for tracking agents, which visit individual servers in their progress of distributed calculations. We present the DA3 formulation based on the IMDS formalism and their application to design and verify distributed systems in the Dedan environment. DA3 formalism is compared with other concepts of distributed automata known from the literature.

Download Full-text

Automatic verification of uml state chart by bogor model checking tool: Automatic formal verification of network and distributed systems

2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI) ◽

10.1109/kbei.2015.7436146 ◽

2015 ◽

Cited By ~ 1

Author(s):

Behzad Soleimani Neysian ◽

Seyed Morteza Babamir

Keyword(s):

Distributed Systems ◽

Model Checking ◽

Formal Verification ◽

Automatic Verification ◽

State Chart

Download Full-text

Patterns of Collective Behavior in Ocsid

Design Pattern Formalization Techniques ◽

10.4018/978-1-59904-219-0.ch004 ◽

2011 ◽

pp. 73-93 ◽

Cited By ~ 2

Author(s):

Joni Helin ◽

Pertti Kellomäki ◽

Tommi Mikkonen

Keyword(s):

Distributed Systems ◽

Software Engineering ◽

Formal Verification ◽

Collective Behavior ◽

Design Patterns ◽

Parametric Form ◽

Common Theme ◽

The Common ◽

Object Interactions ◽

Engineering Concept

This chapter presents an abstraction mechanism for collective behavior in reactive distributed systems. The mechanism allows the expression of recurring patterns of object interactions in a parametric form, and the formal verification of temporal safety properties induced by applications of the patterns. The abstraction mechanism is defined and compared to Design patterns, an established software engineering concept. While there are some obvious similarities, because the common theme is abstraction of object interactions, there are important differences as well. The chapter discusses how the emphasis on full formality affects what can be expressed and achieved in terms of patterns of object interactions. The approach is illustrated with the Observer and Memento patterns.

Download Full-text

Methods for Domain Specification of Verification-Oriented Process Ontology

Modeling and Analysis of Information Systems ◽

10.18255/1818-1015-2019-4-534-549 ◽

2019 ◽

Vol 26 (4) ◽

pp. 534-549

Author(s):

Natalia O. Garanina ◽

Igor S. Anureev ◽

Olesya I. Borovikova ◽

Vladimir E. Zyubin

Keyword(s):

Distributed Systems ◽

Automatic Control ◽

Formal Verification ◽

Control Systems ◽

Formal Semantics ◽

Constructive Method ◽

Process Ontology ◽

Automatic Control Systems ◽

Semantic Markup ◽

Matching Techniques

User-friendly formal specifications and verification of parallel and distributed systems from various subject fields, such as automatic control, telecommunications, business processes, are active research topics due to its practical significance. In this paper, we present methods for the development of verification-oriented domain-specific process ontologies which are used to describe parallel and distributed systems of subject fields. One of the advantages of such ontologies is their formal semantics which make possible formal verification of the described systems. Our method is based on the abstract verification-oriented process ontology. We use two methods of specialization of the abstract process ontology. The declarative method uses the specialization of the classes of the original ontology, introduction of new declarative classes, as well as use of new axioms system, which restrict the classes and relations of the abstract ontology. The constructive method uses semantic markup and pattern matching techniques to link sublect fields with classes of the abstract process ontology. We provide detailed ontological specifications for these techniques. Our methods preserve the formal semantics of the original process ontology and, therefore, the possibility of applying formal verification methods to the specialized process ontologies. We show that the constructive method is a refinement of the declarative method. The construction of ontology of the typical elements of automatic control systems illustrates our methods: we develop a declarative description of the classes and restrictions for the specialized ontology in the Prot´eg´e system in the OWL language using the deriving rules written in the SWRL language and we construct the system of semantic markup templates which implements typical elements of automatic control systems.

Download Full-text