Testing experiments on unbounded systems: synchronizing sequences using Petri nets

TL;DR: In this paper, the authors deal with the problem of recovering a manufacturing system, modeled as a discrete event system (DES) using the Supervisory Control Theory (SCT), when the control structure, called supervisor, desynchronizes from the physical plant.

TL;DR: In this paper, the authors propose a solution classique to solve the problem of failure of the test d'identification d'etat d'un systeme a evenement discret (SED) by using the reseaux de Petri (RdP).

TL;DR: This article shows under what conditions a set of synchronizing plants and specifications leads to a synchronizing supervisor obtained by the supervisory control theory (SCT), and presents a simple way to model problems, composed of machines and buffers, as synchronizing automata such that it is always possible do restore synchronization between the control and the plant.

TL;DR: An algorithm, using ideas of synchronizing automata, automata that reach a specific state when a synchronizing word is executed, regardless of the origin state, is presented.

TL;DR: The fundamental problems in testing finite state machines and techniques for solving these problems are reviewed, tracing progress in the area from its inception to the present and the stare of the art is traced.

TL;DR: This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.

TL;DR: This monograph presents a well written and clearly organized introduction in the standard methods of Petri Nets with the aim to reach an accurate understanding of continuous and hybrid Petri nets, while preserving the consistency of basic concepts throughout the book.

TL;DR: In this article, the free energy difference between the input and output of a molecular computing machine is exploited to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecules as the sole source of power.