X-machines as a basis for dynamic system specification
Software Engineering Journal
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Automata, Languages, and Machines
Automata, Languages, and Machines
Formal Modelling of Reactive Agents as an Aggregation of Simple Behaviours
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Automata and processes on multisets of communicating objects
Natural Computing: an international journal
Hi-index | 0.00 |
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system.Th is paper describes a methodology of building communicating X-machines from existing stand-alone X-machine models and presents the theory that drives this methodology. An X-machine is a formal method that resembles a finite state machine but can model non-trivial data structures.T his is accomplished by incorporating a typed memory tuple into the model as well as transitions labeled with functions that operate on inputs and memory values. A set of X-machines can exchange messages with each other, thus building a communicating system model. Ho wever, existing communicating X-machines theories imply that the components of a communicating system should be built from scratch. We suggest that modeling of complex systems can be split into two separate and distinct activities: (a) the modeling of standalone X-machine components and (b) the description of the communication between these components.Th is approach is based on a different view of the theory of communicating X-machines and it leads towards disciplined, practical, and modular development.T he proposed methodology is accompanied by an example, which demonstrates the use of communicating X-machines towards the modeling of large-scale systems.