Abstract

Conditions under which compositions of component systems form a well-defined system-of-systems are here formulated at a fundamental level. Statement of what defines a well-defined composition and sufficient conditions guaranteeing such a result offers insight into exemplars that can be found in special cases such as differential equation and discrete event systems. For any given global state of a composition, two requirements can be stated informally as: (1) the system can leave this state, i.e., there is at least one trajectory defined that starts from the state; and (2) the trajectory evolves over time without getting stuck at a point in time. Considered for every global state, these conditions determine whether the resultant is a well-defined system and, if so, whether it is non-deterministic or deterministic. We formulate these questions within the framework of iterative specifications for mathematical system models that are shown to be behaviorally equivalent to the Discrete Event System Specification (DEVS) formalism. This formalization supports definitions and proofs of the afore-mentioned conditions. Implications are drawn at the fundamental level of existence where the emergence of a system from an assemblage of components can be characterized. We focus on systems with feedback coupling where existence and uniqueness of solutions is problematic.

Highlights

  • Emergence has been characterized as taking place in strong and week forms

  • We formulate these questions within the framework of iterative specifications for mathematical system models that are shown to be behaviorally equivalent to the Discrete Event System Specification (DEVS) formalism

  • Drawing on Turing machine halting decidability, we investigate the probability of legitimacy for randomly constructed DEVS models

Read more

Summary

Introduction

Emergence has been characterized as taking place in strong and week forms. Mittal [1] pointed out that strong emergent behavior results in generation of new knowledge about the system representing previously unperceived complex interactions. Considered for every global state, these conditions determine whether the resultant is a well-defined system and if so, whether it is non-deterministic or deterministic We formulate these questions within the framework of iterative specifications for mathematical system models that are shown to be behaviorally equivalent to the Discrete Event System Specification (DEVS) formalism. In the re-composed Turing Machine, the TM control starts a cycle of interaction by sending a symbol and move instruction to the tape system waiting passively for a new scanned symbol to arrive. It executes the instruction and sends the symbol under the head to the waiting control Such active–passive compositions provide a class of systems from which we can draw intuition and examples for generalizations about system emergence at the fundamental level. We have laid the conceptual groundwork in which a system has to be well-defined (static condition) and progressive (temporal dynamic condition) if it is to have achieved independent existence when emerging from a composition of components

Basic Discrete Event System Specification
Coupled DEVS Models
Iterative System Specifications
DEVS Simulation of Iterative Specification
Coupled Iterative Specification
Special Case
Active-Passive Systems
Temporal Progress
Discussion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call