Normal processes for modeling the desired behavior of distributed autonomous discrete event systems

Authors:
Eileen Peluso;Jonathan Goldstine;Shashi Phoha
Affiliations:
Department of Mathematical Sciences, Lycoming College, Williamsport, PA;Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA;Division of Information Science and Technology, Applied Research Laboratory, The Pennsylvania State University, University Park, PA
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2001

Citing 10
Cited 1

Communicating sequential processes

Communicating sequential processes
Modeling concurrency with partial orders

International Journal of Parallel Programming
Supervisory control of a class of discrete event processes

SIAM Journal on Control and Optimization
The hierarchical lattices of a finite machine

Systems & Control Letters
Fairness and control in multi-agent systems

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Partial orders and the axiomatic theory of shuffle (pomsets)

Partial orders and the axiomatic theory of shuffle (pomsets)
A hierarchical structure of interacting automata for modeling battlefield dynamics: controllability and formal specification

A hierarchical structure of interacting automata for modeling battlefield dynamics: controllability and formal specification
Hierarchical partition of nonstructured concurrent systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

C3L: an integrated computation, communication and control language for dynamically controlled heterogeneous devices

ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate a class of language-based specifications for modeling the desired behavior of a system of distributed autonomous discrete event systems. We model system behavior using a formal language-based representation of a process. We identify singularity and congruence as inherent constraints on processes in such systems. We define normal processes to be those that are both singular and congruent, and show that normal processes are well-behaved. In particular, they possess a necessary characteristic for conversion into automaton-based models, i.e., they can be uniquely represented by a formal language.