The reverse engineering problem with probabilities and sequential behavior: Probabilistic Sequential Networks

Simple item page
dc.creatorAvino-Diaz, Maria A.
dc.date2007-08-10
dc.date.accessioned2026-07-07T08:23:11Z
dc.date.available2026-07-07T08:23:11Z
dc.descriptionThe reverse engineering problem with probabilities and sequential behavior is introducing here, using the expression of an algorithm. The solution is partially founded, because we solve the problem only if we have a Probabilistic Sequential Network. Therefore the probabilistic structure on sequential dynamical systems is introduced here, the new model will be called Probabilistic Sequential Network, PSN. The morphisms of Probabilistic Sequential Networks are defined using two algebraic conditions, whose imply that the distribution of probabilities in the systems are close. It is proved here that two homomorphic Probabilistic Sequential Networks have the same equilibrium or steady state probabilities. Additionally, the proof of the set of PSN with its morphisms form the category PSN, having the category of sequential dynamical systems SDS, as a full subcategory is given. Several examples of morphisms, subsystems and simulations are given.
dc.descriptionKey words: simulation, homomorphism, dynamical system, sequential network, reverse engineering problem. Submitted to Elsevier
dc.identifierhttps://arxiv.org/abs/0708.1500
dc.identifierhttp://arxiv.org/abs/0708.1500
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135905
dc.subjectDynamical Systems
dc.subjectCategory Theory
dc.subject05C20, 37B99, 68Q65, 93A30, 18B20, 37B19, 60G99
dc.titleThe reverse engineering problem with probabilities and sequential behavior: Probabilistic Sequential Networks
dc.typetext

Files

Collections

arXiv