• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 3
  • Tagged with
  • 15
  • 15
  • 15
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Deadlock Avoidance In Mixed Capacity Flexible Manufacturing Systems

Mohan, Sridhar 08 July 2004 (has links)
This research addressed the design and implementation of a polynomial-complexity deadlock avoidance controller for a flexible manufacturing cell modeled using Colored Petri Nets. The cell model is robust to changes in the part types to be manufactured in the system and is automatically generated using the interaction of the resources in the cell and the technological capabilities of the machines. The model also captures dynamic routing flexibility options. The framework introduced separates the cell model from the control logic allowing the system designer to implement and test various control algorithms using the same cell model. The controller adopts the neighborhood deadlock avoidance policy to resolve deadlocks and control the resource allocation decisions within the system. The evaluation of the performance of systems controlled by not maximally permissive algorithms is important in determining the applicability of the control algorithms. There are many polynomial time deadlock avoidance algorithms proposed for the control of general resource allocation systems. However, the permissiveness of these algorithms is not quantified and the applicability of these algorithms in terms of effective resource utilization remains unanswered. The performance of automated manufacturing cells controlled using the neighborhood deadlock avoidance policy is benchmarked by comparing its performance with other control policies.
2

Algoritmo de conversÃo de Redes de Petri coloridas para Ladder Logic Diagram (LLD) / Algorithm Converting Colored Petri Nets for Ladder Logic Diagram (LLD)

Jonatha Rodrigues da Costa 28 January 2014 (has links)
Neste trabalho à apresentada uma proposta de conversÃo de modelos de cÃlulas de manufatura (FMS) em Redes de Petri Coloridas (RPC) para Ladder Logic Diagram (LLD). Explora-se modelos de RPC controlados - construidos usando-se como metodologia de controle supervisÃrio as RestriÃÃes de Controle sobre Cores Decompostas (RCCD) - e modelos nÃo controlados. Enfatiza-se a transformaÃÃo de RPC nÃo controlada para LLD e a facilidade de inclusÃo do controle. Os resultados aqui descritos demonstram que a metodologia facilita o trabalho de um programador de CLP em LLD minimizando os possÃveis erros durante a fase de programaÃÃo. Para exemplificar a metodologia foi desenvolvido um conversor de RPC para LLD, produzido em ambiente JAVA, afim de evidenciar a dinÃmica de conversÃo. Para a validaÃÃo dos resultados do conversor à usado um robà articulado vertical controlado via CLP, que opera comparativamente com e sem supervisÃo, o qual fora modelado primeiramente em RPC sem supervisÃo, depois aplicada a tÃcnica RCCD, a supervisÃo e a conversÃo para LLD. / In this dissertation, is presented a proposal of conversion of models of manufacturing cell (FMS) from Colored Petri Nets (CPN) to Ladder Logic Diagram (LLD). It explores the controlled CPN models - constructed using the methodology of supervisory Control Restrictions on Decomposed Colors (CRDC) - and not controlled models. It emphasizes the transformation of CPN not controlled for the LLD and ease for inclusion of control. The results described herein demonstrate that the methodology facilitates the work of a PLC programmer in LLD minimizing possible errors during the programming phase. To illustrate the methodology we developed a converter from CPN to LLD, produced in JAVA, in order to clarify the dynamic conversion environment. To validate the results of the converter, is controlled by PLC, a vertical articulated robot which works compared with and without supervision which had been firstly modeled in CPN without supervision, then applied to CRDC, the supervision and the conversion technique for LLD.
3

A General Model of Mobile Environments: Simulation Support for Strategic Management Decisions

Gruhn, Volker, Richter, Thomas 31 January 2019 (has links)
Since the ability of Workforce Management Systems to handle mobility induced challenges of mobile environments like data-communication cut-offs, reduced network bandwidth, and security concerns improved recently, the optimization efforts of mobile enterprises increasingly focus on the organizational setup of their mobile environment. This includes issues like, e.g., the dimension and staffing of regional subdivisions, qualification balance of the workforce, and resource allocation strategies. While this multitude of possible adjustment parameters for optimization prevents from the analytical prediction of organizational change efforts, simulation is a promising approach to analyze mobile environments and their change. In this work we present a formal model representing a generalization of mobile environments. This model can be utilized to examine the cost situation and performance of both real mobile enterprises and projected future development scenarios of such enterprises. The model is developed using colored petri nets (CPN) and the software suite CPN Tools. We show that our model is capable of predicting the outcomes of organizational change projects by the utilization of simulation and present a validation of our model based on real-world data of a German gas and power supply.
4

Proposta de um procedimento para a modelagem de sistemas de controle de edifícios inteligentes utilizando a rede de Petri colorida. / A procedure for modelling the control system in intelligent buildings based on colored Petri nets.

Igei Kaneshiro, Percy Javier 22 August 2011 (has links)
Os avanços tecnológicos das últimas décadas têm motivado o desenvolvimento dos edifícios inteligentes, visando à criação de ambientes mais confortáveis e seguros para os ocupantes, economicamente vantajosos para os proprietários e ambientalmente corretos. Considerando-se que nestes ambientes emergem novas formas de interação entre os usuários e os sistemas prediais, as quais não são adequadamente tratadas por técnicas convencionais de modelagem, torna-se necessário o estudo de novas soluções que abordem essas interações. Assim, este trabalho apresenta a proposta de uma abordagem sistemática para modelar e simular os sistemas de controle de edifícios inteligentes. Considera-se o sistema de controle como um sistema orientado por eventos discretos, no qual a comunicação entre os dispositivos que o constituem é realizada por meio da troca assíncrona de mensagens. Nesta abordagem, é utilizada a rede de Petri colorida para especificar as funcionalidades do edifício inteligente e a interação entre os dispositivos que constituem o seu sistema de controle. Assim, fornece-se um procedimento estruturado para desenvolver modelos que facilita a especificação do algoritmo de controle dos subsistemas do edifício inteligente. Para avaliar as principais características do procedimento proposto, foi apresentado um exemplo de aplicação que aborda a integração das funcionalidades de um sistema de telefonia distribuído e um sistema de vigilância predial. A abordagem de modelagem possibilitou a identificação das funcionalidades dos dispositivos inteligentes que integram o sistema de controle em diferentes níveis de abstração e as interações que ocorrem durante o seu funcionamento. A realização deste trabalho contribui para o aprimoramento de novas abordagens para o desenvolvimento de sistemas de controle com arquiteturas heterárquicas. Estes sistemas são constituídos por dispositivos inteligentes colaborativos, que possuem um elevado grau de autonomia. / Technological advances in recent decades have motivated the development of intelligent buildings, aimed at creating environments more productive for the occupants, economically advantageous for the owners and environmentally correct. New ways of interaction between users and the buildings systems are emerging from these kinds of systems, which are not adequately treated by conventional modeling techniques. In this sense, it is necessary the study of new approaches which address these new functionalities. Thus, this work presents a proposal for a systematic approach to model and simulate the control system of the intelligent buildings. The control system is considered to be a discrete event system, where the communication between the devices that integrate it is oriented by means of asynchronous messages exchange. This approach uses the colored Petri nets in order to specify the functionalities of the building system and their devices interactions. The approach provides a structured procedure to develop models that facilitate the algorithm specification of the control system. In order to verify the main characteristics of the proposed procedure, it is presented an example that is a control system that integrates a distributed telephony system and a surveillance building system. The approach proposed enabled the identification of the main functionalities and interactions of the intelligent devices constituting the control system. The achievement of this thesis contributes to the development of new approaches to develop heterarchical control system architectures. This kind of system architectures is constituted by collaborative intelligent devices that have a high degree of autonomy.
5

Sémantique formelle et vérification automatique de scénarios hiérarchiques multimédia avec des choix interactifs / Formal semantics and automatic verification of hierarchical multimedia scenarios with interactive choices

Arias Almeida, Jaime E. 27 November 2015 (has links)
Notre propos est la conception assistée par ordinateur des scénarios comprenant des contenus multimédia qui interagissent avec les actions extérieures, notamment celles de l’interprète (e.g., spectacles vivants, installations muséales interactives et jeux vidéo). Le contenu multimédia est structuré dans un ordre spatial et temporel selon les exigences de l’auteur. Par conséquent, la complexité potentiellement élevée de ces scénarios nécessite des langages de spécification adéquats pour leur complète description et vérification.Partitions Interactives est un formalisme qui a été proposé comme un modèle pour la composition et l’exécution des scénarios multimédias interactifs. En outre, un séquenceur inter-médias, appelé ISCORE,a été élaboré à partir de la sémantique Petri net proposée par ce formalisme. Au cours des dernières années, I-SCORE a été utilisé avec succès pour la composition et l’exécution des spectacles et des expositions interactives. Néanmoins, ces applications et les applications émergentes telles queles jeux vidéo et les installations muséales interactives, de plus en plus exigent deux caractéristiques que la version stable actuelle de I-SCORE ainsi que son modèle sous-jacent ne supportent pas : (1)des structures de contrôle flexibles comme des conditionnelles et des boucles ; et (2) des mécanismes pour la vérification automatique de scénarios.Dans cette thèse, nous présentons deux modèles formels pour la composition et la vérification automatique de scénarios interactifs multimédia avec des choix interactifs, i.e., des scénarios où l’interprète ou le système peut prendre des décisions au sujet de leur état d’exécution avec un certain degré de liberté définie par le compositeur.Dans notre première approche, nous définissons un nouveau langage de programmation appelé REACTIVEIS dont les programmes sont définis comme des arbres représentant l’aspect hiérarchique des scénarios interactifs et dont les noeuds contiennent les conditions nécessaires pour démarrer et arrêter les objets temporels (TOS). En outre, nous définissons une sémantique opérationnelle basé sur des arbres marqués, contenant dans leurs noeuds, les informations sur le début et la fin de chaque TO. Nous définissons également une interprétation déclarative de REACTIVEIS comme formules de la logique linéaire intuitionniste avec sous exponentiels (SELL). Nous montrons que cette interprétation est adéquate : les dérivations dans la logique correspondent à des traces du programme et vice-versa.Dans notre deuxième approche, nous présentons un système basé sur des Automates Temporisés.Dans le système proposé, nous modélisons des scénarios interactifs comme un réseau d’automates temporisés et les étendons avec des points interactifs gardés par des conditions, permettant ainsi la spécification de comportements avec branchements. Par ailleurs, nous profitons des outils matures et efficaces pour simuler et vérifier automatiquement des scénarios modélisés comme des automates temporisés. Dans notre système, les scénarios peuvent être synthétisés dans un matériel reconfigurable afin de fournir une faible latence et l’exécution en temps réel.Dans cette thèse, nous explorons également une nouvelle façon de définir et mettre en oeuvre des scénarios interactifs, visant à un modèle plus dynamique en utilisant le langage réactif REACTIVEML.Enfin, nous présentons une extension des scénarios interactifs utilisant des réseaux de Petri colorés(CPN) qui vise à traiter des données complexes, en particulier, les données statiques et dynamiques de flux audio. / Interactive multimedia deals with the computer-based design of scenarios consisting of multimediacontent that interacts with external actions and those of the performer (e.g., multimedialive-performance arts, interactive museum installations, and video games). The multimedia content is structured in a spatial and temporal order according to the author’s requirements. Therefore, thepotentially high complexity of these scenarios requires adequate specification languages for theircomplete description and verification.Interactive scores is a formalism which has been proposed as a model for composing and performing interactive multimedia scenarios. In addition, an inter-media sequencer, called I-SCORE, hasbeen developed following the Petri Net semantics proposed by this formalism. During the last years,I-SCORE has been used successfully for the composition and performance of live performances and interactive exhibitions. Nevertheless, these applications and emergent applications such as videogames and interactive museum installations, increasingly demand two features that the current stable version of I-SCORE as well as its underlying model do not support: (1) flexible control structures such as conditionals and loops; and (2) mechanisms for the automatic verification of scenarios.In this dissertation we present two formal models for composition and automatic verification of multimedia interactive scenarios with interactive choices, i.e., scenarios where the performer or thesystem can take decisions about their execution state with a certain degree of freedom defined bythe composer.In our first approach, we define a novel programming language called REACTIVEIS. This language extends the full capacity of temporal organization of interactive scenarios by allowing the composerto use a defined logical system for the specification of the starting and stopping conditions of temporal objects (TOs). REACTIVEIS programs are formally defined as tree-like structures representing the hierarchical aspect of interactive scenarios and whose nodes contain the conditions needed to startand stop the TOs. Moreover, we define an operational semantics based on labeled trees, containing in their nodes, the information about the start and stop times of each TO.We show that this operational semantics offers an intuitive yet precise description of the behavior of interactive scenarios.We also endowed REACTIVEIS with a declarative interpretation as formulas in Intuitionistic LinearLogic with Subexponentials (SELL). We shall show that such interpretation is adequate: derivations in the logic correspond to traces of the program and vice-versa. Hence, we can use all the meta-theory of Intuitionistic Linear Logic (ILL) to reason about interactive scenarios and develop tools for theverification and analysis of interactive scenarios.In our second approach, we present a Timed Automata (TA) based framework. In the proposed framework, we model interactive scenarios as a network of timed automata and extend them with interactive points (IPs) guarded by conditions, thus allowing for the specification of branching behaviors.Moreover, we take advantage of the mature and efficient tools for TA to simulate and automatically verify scenarios. In our framework, scenarios can be synthesized into a reconfigurable hardware in order to provide a low-latency and real-time execution by taking advantage of the physical parallelism,low-latency, and high-reliability of these devices. Furthermore, we implemented a tool to systematically construct bottom-up TA models from the composition environment of I-SCORE. Doing that, we provide a friendly and specialized environment for composing and automatic verification of interactive scenarios. Finally, we present an extension of interactive scenarios using Colored Petri Nets (CPNs) thataims to handle complex data, in particular, dynamic and static data audio streams. [...]
6

DiagnÃstico de Faltas em Sistemas ElÃtricos baseado em Redes de Petri Coloridas e TÃcnicas de Sistemas Especialistas / Fault Diagnosis on Electric Systems, Based on Colored Petri Nets and Expert Systems Techniques

Francisco Gualberto Santos Filho 30 July 2007 (has links)
FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico / Quando o sistema elÃtrico experimenta qualquer distÃrbio uma avalanche de alarmes à reportada ao Centro de OperaÃÃo do Sistema (COS) dificultando ao operador na identificaÃÃo da causa do distÃrbio. O grande volume de informaÃÃes disponibilizado pelos sistemas supervisÃrios em condiÃÃo de falta no sistema elÃtrico à de pouco valor se nÃo possibilitar um rÃpido diagnÃstico, para uma pronta e correta tomada de decisÃo e restabelecimento à condiÃÃo normal de operaÃÃo. Usando como entrada os dados informados pelo SCADA foi desenvolvido um Sistema de DiagnÃstico de Faltas (SDF), baseado em Redes de Petri Coloridas (RPC), que filtra as informaÃÃes do SCADA e à capaz de fornecer em tempo real aos operadores o diagnÃstico para as faltas no sistema. O diagnÃstico à obtido a partir da simulaÃÃo off-line de um expressivo nÃmero de possÃveis faltas no sistema em que a marcaÃÃo final da RPC para cada falta à convertida em diagnÃstico. Um Programa Especialista foi desenvolvido para a interpretaÃÃo da marcaÃÃo final fornecida pela RPC para geraÃÃo automÃtica do diagnÃstico de falta. O Programa Especialista interpreta os resultados do modelo RPC independente do sistema elÃtrico monitorado, diagnosticando os eventos que ocorrem tanto em uma subestaÃÃo quanto nas linhas de transmissÃo que ligam as subestaÃÃes, fornecendo um diagnÃstico rÃpido, sucinto, e com formato e linguagem comuns ao operador. / When a fault occurs in an electrical system often an avalanche of information is made available to the System Operation Center making it difficult to the operator to identify the cause of the fault. The great deal of information provided by the supervisory system is of any value if it does not make easy to the operator, to take a right and prompt decision to bring the system back to normal operation. Based on the SCADA information a Fault Diagnosis System (SDF) was developed, which uses the Colored Petri Nets (CPN) method to filter out the large amount of information made available by the SCADA system and then to give the fault diagnosis. The drawback of the SDF is that the fault diagnosis is developed off line from the CPN final markings for all the likely fault conditions on the power system. In this work an Expert Program is developed to automatically convert the CPN final markings into the system fault diagnosis. The Expert Program interprets the results of the CPN model independent of the monitored electrical system, it diagnosis events that occur in substations as much as the transmission lines that connect the substations, providing a fast and concise diagnosis with common format and language to the operator.
7

Proposta de um procedimento para a modelagem de sistemas de controle de edifícios inteligentes utilizando a rede de Petri colorida. / A procedure for modelling the control system in intelligent buildings based on colored Petri nets.

Percy Javier Igei Kaneshiro 22 August 2011 (has links)
Os avanços tecnológicos das últimas décadas têm motivado o desenvolvimento dos edifícios inteligentes, visando à criação de ambientes mais confortáveis e seguros para os ocupantes, economicamente vantajosos para os proprietários e ambientalmente corretos. Considerando-se que nestes ambientes emergem novas formas de interação entre os usuários e os sistemas prediais, as quais não são adequadamente tratadas por técnicas convencionais de modelagem, torna-se necessário o estudo de novas soluções que abordem essas interações. Assim, este trabalho apresenta a proposta de uma abordagem sistemática para modelar e simular os sistemas de controle de edifícios inteligentes. Considera-se o sistema de controle como um sistema orientado por eventos discretos, no qual a comunicação entre os dispositivos que o constituem é realizada por meio da troca assíncrona de mensagens. Nesta abordagem, é utilizada a rede de Petri colorida para especificar as funcionalidades do edifício inteligente e a interação entre os dispositivos que constituem o seu sistema de controle. Assim, fornece-se um procedimento estruturado para desenvolver modelos que facilita a especificação do algoritmo de controle dos subsistemas do edifício inteligente. Para avaliar as principais características do procedimento proposto, foi apresentado um exemplo de aplicação que aborda a integração das funcionalidades de um sistema de telefonia distribuído e um sistema de vigilância predial. A abordagem de modelagem possibilitou a identificação das funcionalidades dos dispositivos inteligentes que integram o sistema de controle em diferentes níveis de abstração e as interações que ocorrem durante o seu funcionamento. A realização deste trabalho contribui para o aprimoramento de novas abordagens para o desenvolvimento de sistemas de controle com arquiteturas heterárquicas. Estes sistemas são constituídos por dispositivos inteligentes colaborativos, que possuem um elevado grau de autonomia. / Technological advances in recent decades have motivated the development of intelligent buildings, aimed at creating environments more productive for the occupants, economically advantageous for the owners and environmentally correct. New ways of interaction between users and the buildings systems are emerging from these kinds of systems, which are not adequately treated by conventional modeling techniques. In this sense, it is necessary the study of new approaches which address these new functionalities. Thus, this work presents a proposal for a systematic approach to model and simulate the control system of the intelligent buildings. The control system is considered to be a discrete event system, where the communication between the devices that integrate it is oriented by means of asynchronous messages exchange. This approach uses the colored Petri nets in order to specify the functionalities of the building system and their devices interactions. The approach provides a structured procedure to develop models that facilitate the algorithm specification of the control system. In order to verify the main characteristics of the proposed procedure, it is presented an example that is a control system that integrates a distributed telephony system and a surveillance building system. The approach proposed enabled the identification of the main functionalities and interactions of the intelligent devices constituting the control system. The achievement of this thesis contributes to the development of new approaches to develop heterarchical control system architectures. This kind of system architectures is constituted by collaborative intelligent devices that have a high degree of autonomy.
8

Método de resolução de deadlocks no controle de produção de sistemas de manufatura automatizados utilizando redes de Petri coloridas

Souza, Wesley Willy Oliveira de 01 July 2011 (has links)
Made available in DSpace on 2016-06-02T19:06:03Z (GMT). No. of bitstreams: 1 4911.pdf: 4490259 bytes, checksum: 94cfbdb804ef2f55cb81e1163b1c6ad4 (MD5) Previous issue date: 2011-07-01 / Universidade Federal de Sao Carlos / Resources sharing is one of the main characteristics of Automated Manufacturing Systems (SMA), this characteristic can be a synonym of advantages but on the other hand it may lead to the problem of deadlock. Several papers have suggested methods and techniques to reduce or eliminate the occurrence of deadlocks in SMA systems. The deadlock resolution strategies suggested in the literature can be classified into the following types: deadlock detection and recovery, deadlock prevention and deadlock avoidance. This work proposes a resolution method for the control of automated manufacturing systems using colored Petri nets, the main goal of the proposed method is to provide a deadlock-free production controller. To model, simulate and implement the technique in a production controller a dedicated software is used to model the Petri Nets. Initially, a model using Colored Petri Nets is proposed, then changes in the model are introduced in order to eliminate the deadlocks, resulting in a Colored Petri net control model of the SMA. Finally the model is implemented in the scenario of a Flexible Manufacturing System for testing and validation of the method. / O Compartilhamento de recursos é uma das principais características dos Sistemas de Manufatura Automatizados (SMA), esta característica pode ser um sinônimo de vantagens, mas por outro lado pode levar ao problema de deadlock. Diversos trabalhos têm sugerido métodos e técnicas para reduzir ou eliminar a ocorrência de deadlocks em SMA. As estratégias de resolução de deadlock sugerido na literatura podem ser classificados nos seguintes tipos: detecção e recuperação de deadlocks, prevenção de deadlocks e de deadlock. Este trabalho propõe um método de resolução para o controle de sistemas de manufatura automatizados utilizando redes de Petri coloridas, o principal objetivo do método proposto é obter um controlador da produção livre de deadlocks. Para modelar, simular e implementar a técnica em um controlador de produção um software dedicado é usado para modelar a rede de Petri. Inicialmente, um modelo usando Redes de Petri Coloridas é proposto, então mudanças são introduzidas, a fim de eliminar os deadlocks, resultando em um modelo de rede de Petri de um SMA livre de deadlock. Finalmente o modelo é implementado no cenário de um Sistema de Manufatura Flexível para testes e validação do método.
9

A Verification Framework for Component Based Modeling and Simulation : “Putting the pieces together”

Mahmood, Imran January 2013 (has links)
The discipline of component-based modeling and simulation offers promising gains including reduction in development cost, time, and system complexity. This paradigm is very profitable as it promotes the use and reuse of modular components and is auspicious for effective development of complex simulations. It however is confronted by a series of research challenges when it comes to actually practice this methodology. One of such important issue is Composability verification. In modeling and simulation (M&amp;S), composability is the capability to select and assemble components in various combinations to satisfy specific user requirements. Therefore to ensure the correctness of a composed model, it is verified with respect to its requirements specifications.There are different approaches and existing component modeling frameworks that support composability however in our observation most of the component modeling frameworks possess none or weak built-in support for the composability verification. One such framework is Base Object Model (BOM) which fundamentally poses a satisfactory potential for effective model composability and reuse. However it falls short of required semantics, necessary modeling characteristics and built-in evaluation techniques, which are essential for modeling complex system behavior and reasoning about the validity of the composability at different levels.In this thesis a comprehensive verification framework is proposed to contend with some important issues in composability verification and a verification process is suggested to verify composability of different kinds of systems models, such as reactive, real-time and probabilistic systems. With an assumption that all these systems are concurrent in nature in which different composed components interact with each other simultaneously, the requirements for the extensive techniques for the structural and behavioral analysis becomes increasingly challenging. The proposed verification framework provides methods, techniques and tool support for verifying composability at its different levels. These levels are defined as foundations of a consistent model composability. Each level is discussed in detail and an approach is presented to verify composability at that level. In particular we focus on theDynamic-Semantic Composability level due to its significance in the overallcomposability correctness and also due to the level of difficulty it poses in theprocess. In order to verify composability at this level we investigate the application ofthree different approaches namely (i) Petri Nets based Algebraic Analysis (ii) ColoredPetri Nets (CPN) based State-space Analysis and (iii) Communicating SequentialProcesses based Model Checking. All the three approaches attack the problem ofverifying dynamic-semantic composability in different ways however they all sharethe same aim i.e., to confirm the correctness of a composed model with respect to itsrequirement specifications. Beside the operative integration of these approaches inour framework, we also contributed in the improvement of each approach foreffective applicability in the composability verification. Such as applying algorithmsfor automating Petri Net algebraic computations, introducing a state-space reductiontechnique in CPN based state-space analysis, and introducing function libraries toperform verification tasks and help the molder with ease of use during thecomposability verification. We also provide detailed examples of using each approachwith different models to explain the verification process and their functionality.Lastly we provide a comparison of these approaches and suggest guidelines forchoosing the right one based on the nature of the model and the availableinformation. With a right choice of an approach and following the guidelines of ourcomponent-based M&amp;S life-cycle a modeler can easily construct and verify BOMbased composed models with respect to its requirement specifications. / <p>Overseas Scholarship for PHD in selected Studies Phase II Batch I</p><p>Higher Education Commision of Pakistan.</p><p>QC 20130224</p>
10

Fluxo de dados em redes de Petri coloridas e em grafos orientados a atores / Dataflow in colored Petri nets and in actors-oriented workflow graphs

Borges, Grace Anne Pontes 11 September 2008 (has links)
Há três décadas, os sistemas de informação corporativos eram projetados para apoiar a execução de tarefas pontuais. Atualmente, esses sistemas também precisam gerenciar os fluxos de trabalho (workflows) e processos de negócio de uma organização. Em comunidades científicas de físicos, astrônomos, biólogos, geólogos, entre outras, seus sistemas de informações distinguem-se dos existentes em ambientes corporativos por: tarefas repetitivas (como re-execução de um mesmo experimento), processamento de dados brutos em resultados adequados para publicação; e controle de condução de experimentos em diferentes ambientes de hardware e software. As diferentes características dos dois ambientes corporativo e científico propiciam que ferramentas e formalismos existentes ou priorizem o controle de fluxo de tarefas, ou o controle de fluxo de dados. Entretanto, há situações em que é preciso atender simultaneamente ao controle de transferência de dados e ao controle de fluxo de tarefas. Este trabalho visa caracterizar e delimitar o controle e representação do fluxo de dados em processos de negócios e workflows científicos. Para isso, são comparadas as ferramentas CPN Tools e KEPLER, que estão fundamentadas em dois formalismos: redes de Petri coloridas e grafos de workflow orientados a atores, respectivamente. A comparação é feita por meio de implementações de casos práticos, usando os padrões de controle de dados como base de comparação entre as ferramentas. / Three decades ago, business information systems were designed to support the execution of individual tasks. Todays information systems also need to support the organizational workflows and business processes. In scientific communities composed by physicists, astronomers, biologists, geologists, among others, information systems have different characteristics from those existing in business environments, like: repetitive procedures (such as re-execution of an experiment), transforming raw data into publishable results; and coordinating the execution of experiments in several different software and hardware environments. The different characteristics of business and scientific environments propitiate the existence of tools and formalisms that emphasize control-flow or dataflow. However, there are situations where we must simultaneously handle the data transfer and control-flow. This work aims to characterize and define the dataflow representation and control in business processes and scientific workflows. In order to achieve this, two tools are being compared: CPN Tools and KEPLER, which are based in the formalisms: colored Petri nets and actors-oriented workflow graphs, respectively. The comparison will be done through implementation of practical cases, using the dataflow patterns as comparison basis.

Page generated in 0.4658 seconds