Vehicular Ad-hoc Network (VANET) is considered to be a viable technology for inter- vehicle communications for the purpose of improving road safety and efficiency. The En- hanced Distribution Channel Access (EDCA) mechanism and multichannel operations are introduced to ensure the Quality of Service (QoS). Therefore, it is necessary to create an accurate vehicular network simulator that guarantees the vehicular communications will work as described in the protocols. A comprehensive vehicular network simulator should consider the interaction between mobility models and network protocols. In this dissertation, a novel vehicular network simulation environment, VANET Toolbox, designed using discrete-event system (DES) is presented. The APP layer DES Module of the proposed simulator integrates vehicular mo- bility operations with message generation functions. The MAC layer DES module supports single channel and multichannel EDCA operations. The PHY layer DES module supports bit-level processing. Compared with packet-based simulator such as NS-3, the proposed PHY layer is more realistic and accurate. The EDCA scheme is evaluated and compared with the traditional Carrier-Sensing Mul- tiple Access (CSMA) scheme, with the simulations proving that data with different priorities can coexist in the same channel. The multichannel operation for the EDCA scheme is also analyzed in this dissertation. The multichannel switching operation and coordination may cause packet dropping or increased latency to the communication. The simulations show that with heavy network traffic, multichannel communication performs better than single channel communication. From the perspective of safety-related messages, the multichannel operation is able to isolate the interference from the non-safety messages in order to achieve a better packet delivery rate and latency. On the other hand, the non-safety messages can achieve high throughput with reasonable latency from multichannel communication under heavy load traffic scenario.

No description available.

No description available.

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.

Uma vez que uma aplicação ou projeto tenha sido identificado como sujeito ao uso da simulação, decisões devem ser tomadas acerca de como conduzir os estudos. Embora não haja regras definitivas, alguns passos são geralmente recomendados, tais como: planejamento do estudo, definição do sistema, construção do modelo, execução dos experimentos, análise dos resultados e relatório final. E, a construção do modelo é uma das etapas mais demoradas e complexas. Na execução dos experimentos, e na análise dos resultados a Realidade Virtual (RV) é uma interface que pode fornecer um suporte importante para a tomada de decisões, pois a RV auxilia na criação de mundos virtuais semelhantes ao mundo real, que ajudam na compreensão do funcionamento dos sistemas. Este trabalho propõe um metamodelo para o desenvolvimento de sistemas de simulação de eventos discretos com interface de RV aplicados a ambientes ou estações de trabalho de manufatura. A proposta do metamodelo é composto por quatro módulos: i) de edição e validação de modelos, ii) de criação, edição e execução de ambientes virtuais, iii) de conexão para efetuar o elo entre os dois primeiros módulos e, iv) de controle para gerenciar a comunicação e controlar a simulação. Como resultado tem-se a simulação centralizada baseada no modelo descrito em Rede de Petris (RP) com interface de RV distribuída. O sistema computacional gerado pelo metamodelo auxiliará no aprendizado e compreensão do problema simulado, e ainda permitirá ao usuário o envolvimento através da iteração. / The VR aids in the creation of virtual worlds similar to the real world, helping in understanding how a system works. This research work is concerned with the development of a discrete-event system simulation based on Petri Nets, with Virtual Reality interface for manufacturing environment or workstations. The system is composed of four modules, the first is model editing and validation, the second module is a modeling tool for virtual objects and/or a library of virtual elements, the third module makes the link between the two previous modules, and finally, the fourth is a simulation and control module. The centralized simulation is based on models described by Petri Nets with distributed RV interface resulting in a flexible and consistent system. The system will help users in learning and understanding the simulation problem, and it will also allow the user\'s integration with the environment through the interaction, and through distributed interface.

The need for redesigning existing business processes to improve their efficiency makes it essential to adequately represent, study, and automate them. The WFMC defines "workflow" as computerized facilitation or automation of a business process in whole or part. It is actually a representation of the given process, which is made up of well-defined collection of activities called tasks. Modeling and specification of a workflow involves the following steps: 1) Provide formalism for modeling and specification of workflow 2) specify the tasks together with the associated information and 3) enter the applicable business rules in form of inter-task dependencies. Earlier attempts at modeling of workflows are based on a centralized control approach, has limited applicability for modeling and control of real life workflow due to computational complexity. In this thesis, a distributed supervisory control approach is described and shown to be computationally tractable. The application of such an approach is demonstrated with a case study.

Fault diagnosis in discrete event systems is studied using a state-based framework. Faults can be either intermittent or permanent. For intermittent faults, system may recover from faulty behaviour through reset. To diagnose such intermittent faults, fault counters are introduced. Fault counters record the number of intermittent faults which must have occurred according to the output observations. This provides the main diagnosis. They also record the number of possible intermittent faults which may have occurred but cannot be confirmed. This provides auxiliary diagnostic information. Fault diagnosability is then studied. Since faults may be intermittent, they may occur repeatedly. Three different notions are studied: 1-diagnosability, 1,k-diagnosability, and 1,infty-diagnosability, and criteria for each of these notions are obtained. The criteria are expressed in terms of fault counters and extend the diagnosability criteria for permanent faults. The concept of a resonant path is introduced, which plays an important role in studying diagnosability.

Fault diagnosis in discrete event systems is studied using a state-based framework. Faults can be either intermittent or permanent. For intermittent faults, system may recover from faulty behaviour through reset. To diagnose such intermittent faults, fault counters are introduced. Fault counters record the number of intermittent faults which must have occurred according to the output observations. This provides the main diagnosis. They also record the number of possible intermittent faults which may have occurred but cannot be confirmed. This provides auxiliary diagnostic information. Fault diagnosability is then studied. Since faults may be intermittent, they may occur repeatedly. Three different notions are studied: 1-diagnosability, 1,k-diagnosability, and 1,infty-diagnosability, and criteria for each of these notions are obtained. The criteria are expressed in terms of fault counters and extend the diagnosability criteria for permanent faults. The concept of a resonant path is introduced, which plays an important role in studying diagnosability.

Title from PDF of title page. / Document formatted into pages; contains 83 pages. / Thesis (M.S.I.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: The need for redesigning existing business processes to improve their efficiency makes it essential to adequately represent, study, and automate them. The WFMC defines "workflow" as computerized facilitation or automation of a business process in whole or part. It is actually a representation of the given process, which is made up of well-defined collection of activities called tasks. Modeling and specification of a workflow involves the following steps: 1) Provide formalism for modeling and specification of workflow 2) specify the tasks together with the associated information and 3) enter the applicable business rules in form of inter-task dependencies. Earlier attempts at modeling of workflows are based on a centralized control approach, has limited applicability for modeling and control of real life workflow due to computational complexity. In this thesis, a distributed supervisory control approach is described and shown to be computationally tractable. / ABSTRACT: The application of such an approach is demonstrated with a case study. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete event systems, Sampath et al. proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete event systems and gave a method for testing the diagnosability by first constructing a diagnoser for the system. The complexity of this method of testing diagnosability is exponential in the number of states of the system and doubly exponential in the number of failure types. In this thesis, we give an algorithm for testing diagnosability that does not construct a diagnoser for the system, and its complexity is of 4th order in the number of states of the system and linear in the number of the failure types. In this dissertation we also study diagnosis of discrete event systems (DESs) modeled in the rule-based modeling formalism introduced in [12] to model failure-prone systems. The results have been represented in [43]. An attractive feature of rule-based model is it's compactness (size is polynomial in number of signals). A motivation for the work presented is to develop failure diagnosis techniques that are able to exploit this compactness. In this regard, we develop symbolic techniques for testing diagnosability and computing a diagnoser. Diagnosability test is shown to be an instance of 1st order temporal logic model-checking. An on-line algorithm for diagnosersynthesis is obtained by using predicates and predicate transformers. We demonstrate our approach by applying it to modeling and diagnosis of a part of the assembly-line. When the system is found to be not diagnosable, we use sensor refinement and sensor augmentation to make the system diagnosable. In this dissertation, a controller is also extracted from the maximally permissive supervisor for the purpose of implementing the control by selecting, when possible, only one controllable event from among the ones allowed by the supervisor for the assembly line in automaton models.