This paper deals with the CREP (Configuration REachability Problem) for non-uniform cellular automata (CAs). The cells of CAs, we have considered here, can use different Wolfram’s rules to generate their next states. We report an algorithm which decides whether or not a configuration given (non-uniform) automaton is reachable from another configuration. develop characterization tool, named Reac...

BioAmbients (BA) is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of fragments of the full model and the comparison with other computational models. In this paper, we investigate the impact of the merge capability, used for fusing the c...

Matching logic reachability is an emerging verification approach which uses a language-independent proof system to prove program properties based on the operational semantics. In this paper we apply this approach in the context of a low-level real-time language with interrupts, in which each instruction takes a specified time to execute. In particular, we verify that if the interrupts are sched...

The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When high-level Petri nets are under consideration, the size of the graph most often is infinite or large. The reason for this combinato...

Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veriication tasks for such programs can be expressed as reachability problems for hybrid au-tomata. By improving on previous decidability and un-decidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automat...

Reachability testing is a mixture strategy, combine non-deterministic and deterministic testing accomplishes a test run deterministically up to a definite point and then allow synchronized program to work non-deterministically. A game theoretic approach is the learning approach of mathematical models of variance and collaboration between intellectual rational decision-makers. To overcome the co...

We consider the reachability problem on transition systems corresponding to succinct one-counter machines, that is, machines where the counter is incremented or decremented by a value given in binary.

In this paper a detailed proof will be given of the solvability of the halting and reachability problem for binary 2-tag systems.