Adaptability checking in complex systems
21
TL;DR: A relational characterisation of strong and weak adaptability is provided and it is shown that adaptability checking, i.e. deciding if a system is weakly or strongly adaptable, can be reduced to a CTL model checking problem.
read more
About: This article is published in Science of Computer Programming. The article was published on 01 Jan 2016. and is currently open access. The article focuses on the topics: Abstraction model checking & Adaptability.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Topological Characterization of Complex Systems: Using Persistent Entropy
TL;DR: The presented methodology is applied to a real case study, the idiotypic network of the mammalian immune system, and is derived using the newly-introduced quantitative concept of persistent entropy.
A symbolic model checking approach in formal verification of distributed systems
TL;DR: Graphical Symbolic Modeling Toolkit (GSMT) is presented to design and verify the behavioral models of distributed systems to improve the model checking weaknesses.
An algebraic language for RNA pseudoknots comparison
TL;DR: An algebraic language to represent RNA secondary structures with arbitrary pseudoknots is introduced and it is shown that the tree grammar with its operators permit to uniquely represent any RNA secondary structure as a tree.
Smart Airports: Review and Open Research Issues
Zainab Alansari,Zainab Alansari,Safeeullah Soomro,Mohammad Riyaz Belgaum +3 more
- 19 Aug 2019
TL;DR: In this paper, the main objectives of the study are to improve the experience of travelers, to make new income streams and to increase operational excellence and enhance security at the airports, while identifying the areas for different sectors supporting the airport management to provide better smart services to the travellers leading to a smart world.
18
Towards modeling and runtime verification of self-organizing systems
TL;DR: A novel runtime verification method to verify self-organizing systems is employed and a novel policy-based runtime verification mechanism is proposed to ensure that the safety properties are satisfied by the implementation at runtime.
16
References
Statecharts: A visual formalism for complex systems
TL;DR: It is intended to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach.
7.5K
•Book
Principles of Model Checking
Christel Baier,Joost-Pieter Katoen +1 more
- 25 Apr 2008
TL;DR: Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
The temporal logic of programs
Amir Pnueli
- 30 Sep 1977
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
5.8K
Automatic verification of finite-state concurrent systems using temporal logic specifications
TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Edmund M. Clarke,E. Allen Emerson +1 more
- 01 May 1981
TL;DR: It is shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification and it is believed that this approach may in the long run turn out to be quite practical.
2.6K