scholarly journals AIGEN: Random Generation of Symbolic Transition Systems

2021 ◽  
pp. 435-446
Author(s):  
Swen Jacobs ◽  
Mouhammad Sakr
Keyword(s):  
Data Structures ◽  
Boolean Functions ◽  
Disjunctive Normal Form ◽  
Benchmark Problems ◽  
Transition Systems ◽  
Ordered Binary Decision Diagrams ◽  
Memory Efficiency ◽  
Canonical Representations ◽  
Symbolic Transition Systems ◽  
Uniform Random Sampling

AbstractAIGEN is an open source tool for the generation of transition systems in a symbolic representation. To ensure diversity, it employs a uniform random sampling over the space of all Boolean functions with a given number of variables. AIGEN relies on reduced ordered binary decision diagrams (ROBDDs) and canonical disjunctive normal form (CDNF) as canonical representations that allow us to enumerate Boolean functions, in the former case with an encoding that is inspired by data structures used to implement ROBDDs. Several parameters allow the user to restrict generation to Boolean functions or transition systems with certain properties, which are then output in AIGER format. We report on the use of AIGEN to generate random benchmark problems for the reactive synthesis competition SYNTCOMP 2019, and present a comparison of the two encodings with respect to time and memory efficiency in practice.

scholarly journals Natural Projection as Partial Model Checking

2020 ◽  
Vol 64 (7) ◽  
pp. 1445-1481
Author(s):  
Gabriele Costa ◽  
Letterio Galletta ◽  
Pierpaolo Degano ◽  
David Basin ◽  
Chiara Bodei
Keyword(s):  
Model Checking ◽  
Control Theory ◽  
Control Flow ◽  
Point Of View ◽  
Natural Projection ◽  
Transition Systems ◽  
Partial Model ◽  
Finite State ◽  
Symbolic Transition Systems ◽  
Large Systems

Abstract Verifying the correctness of a system as a whole requires establishing that it satisfies a global specification. When it does not, it would be helpful to determine which modules are incorrect. As a consequence, specification decomposition is a relevant problem from both a theoretical and practical point of view. Until now, specification decomposition has been independently addressed by the control theory and verification communities through natural projection and partial model checking, respectively. We prove that natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent. Apart from their foundational interest, our results build a bridge whereby the control theory community can reuse algorithms and results developed by the verification community. Furthermore, we extend the notions of natural projection and partial model checking from finite-state to symbolic transition systems and we show that the equivalence still holds. Symbolic transition systems are more expressive than traditional finite-state transition systems, as they can model large systems, whose behavior depends on the data handled, and not only on the control flow. Finally, we present an algorithm for the partial model checking of both kinds of systems that can be used as an alternative to natural projection.

Symbolic-Based Monitoring for Embedded Applications

2015 ◽  
pp. 939-961
Author(s):  
Pramila Mouttappa ◽  
Stephane Maag ◽  
Ana Cavalli
Keyword(s):  
System Design ◽  
Research Community ◽  
Input Output ◽  
Transition Systems ◽  
Execution Traces ◽  
Novel Approach ◽  
Security Properties ◽  
Symbolic Transition Systems ◽  
And Control ◽  
Embedded Applications

Testing embedded systems to find errors and to validate that the implemented system as per the specifications and requirements has become an important part of the system design. The research community has proposed several formal approaches these last years, but most of them only consider the control portion of the protocol, neglecting the data portions, or are confronted with an overloaded amount of data values to consider. In this chapter, the authors present a novel approach to model protocol properties of embedded application in terms of Input-Output Symbolic Transition Systems (IOSTS) and show how they can be tested on real execution traces taking into account the data and control portions. These properties can be designed to test the conformance of a protocol as well as security aspects. A parametric trace slicing approach is presented to match trace and property. This chapter is illustrated by an application to a set of real execution traces extracted from a real automotive Bluetooth framework with functional and security properties.

scholarly journals A heuristic method for bi-decomposition of partial Boolean functions

Informatics ◽  
2020 ◽  
Vol 17 (3) ◽  
pp. 44-53
Author(s):  
Yu. V. Pottosin
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Heuristic Method ◽  
Disjunctive Normal Form ◽  
The Other ◽  
Output Function ◽  
Minimal Rank ◽  
Boolean Space ◽  
Definitional Domain ◽  
The Given

The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function. The bi-decomposition represents a given function as a logic algebra operation, which is also given, over two Boolean functions. The task is reduced to specification of those two functions. A method for bi-decomposition of incompletely specified (partial) Boolean function is suggested. The given Boolean function is specified by two sets, one of which is the part of the Boolean space of the arguments of the function where its value is 1, and the other set is the part of the space where the function has the value 0. The complete graph of orthogonality of Boolean vectors that constitute the definitional domain of the given function is considered. In the graph, the edges are picked out, any of which has its ends corresponding the elements of Boolean space where the given function has different values. The problem of bi-decomposition is reduced to the problem of a weighted two-block covering the set of picked out edges of considered graph by its complete bipartite subgraphs (bicliques). Every biclique is assigned with a disjunctive normal form (DNF) in definite way. The weight of a biclique is a pair of certain parameters of   assigned DNF. According to each biclique of obtained cover, a Boolean function is constructed whose arguments are the variables from the term of minimal rank on the DNF. A technique for constructing the mentioned cover for two kinds of output function is described.

Sign in / Sign up

Export Citation Format

Share Document