Academic literature on the topic 'SIGNED PETRI NETS'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SIGNED PETRI NETS.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SIGNED PETRI NETS"

1

Kansal, Sangita, and Payal Dabas. "An Introduction to Signed Petri Net." Journal of Mathematics 2021 (June 15, 2021): 1–8. http://dx.doi.org/10.1155/2021/5595536.

Full text
Abstract:
In this paper, the notion of a signed graph and Petri net (PN) is combined to introduce a new concept of Signed Petri net (SiPN). The balancedness in the signed graph, formulated by Harary and Cartwright, can be used to study and analyze social networks. This notion of balancedness is extended to Petri net via SiPN as such a concept has not been defined for already existing Petri nets. A balanced SiPN has been defined and its characterization is given. An illustrative example is provided which utilizes the newly introduced concept of assignment of sign to places of SiPN to determine whether an online transaction initiated by a bank customer is denied or approved by the bank. Lastly, applications of SiPN in the message transmission system and production unit are discussed. These concepts clearly demonstrate the advantages of the proposed approach of SiPN.
APA, Harvard, Vancouver, ISO, and other styles
2

Murdianto, Deny, Shinta Tri Kismanti, and Dwi Santoso. "Model Petri Net Produksi Tahu Pada Industri Skala Rumah Tangga." Contemporary Mathematics and Applications (ConMathA) 5, no. 2 (October 26, 2023): 54–63. http://dx.doi.org/10.20473/conmatha.v5i2.47291.

Full text
Abstract:
The process of making tofu includes several steps, namely the process of soaking soybeans, washing soybeans, milling soybeans, boiling or cooking, filtering, settling and adding vinegar. The purpose of this study it was to obtain a Petri Net model of the tofu making process and perform simulations with signed Petri Nets. Simulations are carried out to determine the dynamics that occur during the process of making tofu. The data used is by observation in a household-scale tofu and tempeh processing industry in Tarakan City. The Petri Net model obtained consists of six transitions and ten places. Assuming that every enable transition will always be fired in every state, there are sixteen possible states that can be achieved in the Petri Net simulation.
APA, Harvard, Vancouver, ISO, and other styles
3

Tian, Yinhua, Xiaowen Pang, Yan Su, Dong Han, and Yuyue Du. "Cross-Departmental Collaboration Approach for Earthquake Emergency Response Based on Synchronous Intersection between Traditional and Logical Petri Nets." Electronics 12, no. 5 (March 2, 2023): 1207. http://dx.doi.org/10.3390/electronics12051207.

Full text
Abstract:
In order to reduce the harm of earthquakes to human society, all governments actively promote the construction and development of earthquake emergency rescue work. The earthquake emergency response involves many departments, multiple personnel and large rescue forces, which presents a great challenge to the ability to carry out cross-departmental rescue work in a collaborative and joint manner. A novel collaboration approach based on traditional and logical Petri nets is proposed to improve the cross-departmental collaboration in earthquake emergency response. The approach extends the synchronization of transitions in traditional Petri nets to that of traditional and logical transitions in traditional and logical Petri nets, and defines the intersection of related logical functions. The approach builds a model for the earthquake emergency response plans of various departments with the help of traditional and logical Petri net models, and then performs synchronous intersection operations on the two kinds of Petri nets and merges the two kinds of Petri nets into new logical Petri nets. Meanwhile, through realizing the collaboration ability of cross-departmental work, the approach improves the rescue efficiency and reduces the damage of the earthquake emergency.
APA, Harvard, Vancouver, ISO, and other styles
4

Staines, Anthony Spiteri. "Concurrency and Petri Net Models." International Journal of Circuits, Systems and Signal Processing 16 (March 11, 2022): 852–58. http://dx.doi.org/10.46300/9106.2022.16.104.

Full text
Abstract:
Concurrency is a fundamental problem and a solution applicable to different areas of computing. Given the complexities and distribution of computer systems and services, concurrency is a modern area requiring proper attention. Petri nets are formalisms based on process representation both from a mathematical view and from a graphical or drawing like view. Petri nets are used to model concurrent processes. This work deals with understanding and representing low level concurrency in Petri nets, when this is not always visible and properly noted from the graphical structure. In this study an algebraic notation has been devised and is used to represent the Petri net structures. This algebraic notation is used as an alternative and simplified way of representation. The notation is explained and several simple examples are given. The notation presented can be used in conjunction with other Petri net analysis and verification methods. Some results and findings are discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

Jiao, Li. "A note on regular Petri nets." Information Processing Letters 108, no. 3 (October 2008): 110–14. http://dx.doi.org/10.1016/j.ipl.2008.04.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kanich, Ondřej, and Martin Drahanský. "Simulation of synthetic fingerprint generation using Petri nets." IET Biometrics 6, no. 6 (April 11, 2017): 402–8. http://dx.doi.org/10.1049/iet-bmt.2016.0041.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Perše, Matej, Matej Kristan, Janez Perš, Gašper Mušič, Goran Vučkovič, and Stanislav Kovačič. "Analysis of multi-agent activity using petri nets." Pattern Recognition 43, no. 4 (April 2010): 1491–501. http://dx.doi.org/10.1016/j.patcog.2009.11.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yakrangi, Oz, Roque J. Saltarén Pazmiño, Juan S. Cely, Alejandro Rodríguez, Cecilia E. García Cena, Pablo San Segundo Carrillo, Julio De La Cueva, and Amir Shapiro. "An Intelligent Algorithm for Decision Making System and Control of the GEMMA Guide Paradigm Using the Fuzzy Petri Nets Approach." Electronics 10, no. 4 (February 19, 2021): 489. http://dx.doi.org/10.3390/electronics10040489.

Full text
Abstract:
The aim of this article is to present the fuzzy Petri net algorithm and its implementation on the Guide d’etude des modes de marche et d’arrêt (GEMMA) guide paradigm. Additionally, this article presents a brief description of the GEMMA guide paradigm, the fuzzy logic approach, the Petri nets theory, and fuzzy Petri nets. Each algorithm is intended for a specific set of transitions, depending on their essential conditions. All these algorithms generate intelligent and safe control of the GEMMA guide paradigm in order to have the best control system for the machine. Moreover, the algorithms are able to make the best decision automatically depending on the machine’s situation and condition, something that allows the machine to be placed in the appropriate mode for each situation. The results show that the different fuzzy Petri net algorithms were working properly for the GEMMA guide paradigm and provided a proper solution for the automation of production systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Best, Eike, and Javier Esparza. "Existence of home states in Petri nets is decidable." Information Processing Letters 116, no. 6 (June 2016): 423–27. http://dx.doi.org/10.1016/j.ipl.2016.01.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dworzański, L. W., and I. A. Lomazova. "CPN tools-assisted simulation and verification of nested Petri nets." Automatic Control and Computer Sciences 47, no. 7 (December 2013): 393–402. http://dx.doi.org/10.3103/s0146411613070201.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "SIGNED PETRI NETS"

1

LIU, Baisi. "An Efficient Approach for Diagnosability and Diagnosis of DES Based on Labeled Petri Nets, Untimed and Timed Contexts." Phd thesis, Ecole Centrale de Lille, 2014. http://tel.archives-ouvertes.fr/tel-01064597.

Full text
Abstract:
Cette thèse s'intéresse à l'étude des problèmes de diagnostic des fautes sur les systèmes à événements discrets dans des contextes atemporel et temporel sur la base de modèles réseau de Petri. Des techniques d'exploration incrémentale et à-la-volée sont développées pour combattre le problème de l'explosion de l'espace d'état. Dans le contexte atemporel, une représentation algébrique pour les réseaux de Petri labellisés (RdP-L) a été développée pour caractériser le comportement du système. La diagnosticabilité de modèles RdP-L est ensuite abordée par l'analyse d'une série de problèmes d'analyse de K -diagnosticabilité, où K peut être augmenté progressivement. Concrètement, l'analyse de la diagnosticabilité est effectuée sur la base de deux modèles nommés respectivement FM-graph et FM-set tree qui sont développés à-la-volée et qui contiennent les informations relatives aux fautes. Un diagnostiqueur peut facilement être dérivé à partir du FM-set tree pour le diagnostic en ligne. Dans le contexte temporel, une technique de fractionnement des intervalles de temps a été élaborée pour développer une représentation de l'espace d'état des réseaux de Petri labellisés et temporels (RdP-LT) pour laquelle des techniques d'analyse de la diagnosticabilité du contexte atemporel, peuvent être exploitées. Sur cette base, les conditions nécessaires et suffisantes pour la diagnosticabilité de RdP-LT ont été déterminées, et nous présentons la solution pour le délai minimum qui assure la diagnosticabilité. En pratique, l'analyse de la diagnosticabilité est effectuée sur la base de la construction à-la-volée d'une structure que l'on appelle ASG et qui contient des informations relatives à l'occurrence de fautes sur les états du RdP-LT. D'une manière générale, l'analyse effectuée sur la base des techniques à-la-volée et incrémentale permet de construire et explorer seulement une partie de l'espace d'état. Les résultats des analyses effectuées sur certains benchmarks montrent l'efficacité des techniques que nous avons développées en termes de temps et de mémoire par rapport aux approches traditionnelles basées sur l'énumération des états.
APA, Harvard, Vancouver, ISO, and other styles
2

Abellard, Patrick. "Contribution a l'etude d'extensions des reseaux de petri a flux de donnees pour la telesymbiotique assistee par calculateur." Toulon, 1988. http://www.theses.fr/1988TOUL0003.

Full text
Abstract:
Etude d'extensions concernant le traitement des donnees matricielles, la colorabilite des reseaux et la modelisation des reseaux systoliques permet de couvrir un large champ d'applications. Les resultats theoriques obtenus ont ete implementes sur un multiprocesseur construit a base de processeurs a flux de donnees
APA, Harvard, Vancouver, ISO, and other styles
3

Mladenovic, Milos Novica. "Modeling and Assessment of State-Of-The-Art Traffic Control Subsystems." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/32193.

Full text
Abstract:
Traffic signals are one of the vital control elements of traffic management and control systems under purview of Departments of Transportation (DOTs) nationwide. They directly affect mobility, safety, and environmental parameters of the transportation networks. Traffic engineers in DOTs often face pressure for extracting additional benefits from existing signal control equipment, influenced by evident increase in demand and changing traffic patterns. However, they often face difficulties, usually from the maturity of the field equipment, lack of understanding of currently available equipment capabilities, and multitude of market available equipment. Besides issues in everyday operation, the need for improved decision-making process appears during selection and implementation of the future signal-control subsystems. This thesis is focusing on the issues related with the need for extracting additional benefits and improved planning of signal-control equipment deployment. Presented are several methodologies and techniques for modeling and assessing traffic signal controllers and supporting communication infrastructure. Techniques presented in this thesis include Petri Net modeling language, Software-in-the-loop simulation, and Geographical Information Systems. Specific capabilities of listed techniques are coordinated for maximizing their benefits in addressing specific issues. The intended positive effects reflect in enhanced comprehension, numerical representation, and analysis of state-of-the-art signal control subsystems in focus. Frameworks, methodologies, and example cases are presented for each of the specific issues in identified traffic signal subsystems, along with recommendations for further research.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
4

Sun, Pengfei. "Ingénierie de modèle pour la sécurité des systèmes critiques ferroviaires." Thesis, Ecole centrale de Lille, 2015. http://www.theses.fr/2015ECLI0018/document.

Full text
Abstract:
Le développement et l’application des langages formels sont un défi à long terme pour la science informatique. Un enjeu particulier est l’acceptation par l’industrie. Cette thèse présente une approche pour la modélisation et la vérification des postes d’aiguillage français. La première question est la modélisation du système d’enclenchement par les réseaux de Petri colorés (RdPC). Un cadre de modélisation générique et compact est introduit, dans lequel les règles d’enclenchement sont modélisées dans une structure hiérarchique, tandis que les installations sont modélisées dans une perspective géographique. Ensuite, un patron de modèle est présenté. C’est un modèle paramétré qui intègre les règles nationales françaises qui peut être appliquée pour différentes gares. Puis, un concept basé sur l’événement est présenté dans le processus de modélisation des parties basses des postes d’aiguillage. La deuxième question est la transformation des RdPCs en machines B, qui va aider les concepteurs sur la route de l’analyse à application. Tout d’abord, une méthodologie détaillée, s’appuyant sur une table de correspondance, du RdPCs non-hiérarchiques vers les notations B est présentée. Ensuite, la hiérarchie et la priorité des transitions du RdPC sont successivement intégrées dans le processus de mapping, afin d’enrichir les possibilités de types de modèles en entrées de la transformation. Les machines B produites par la transformation permettent la preuve automatique intégrale par l’Atelier B. L’ensemble de ces travaux, chacun à leur niveau, contribuent à renforcer l’efficacité d’un cadre global d’analyse sécuritaire
Development and application of formal languages are a long-standing challenge within the computer science domain. One particular challenge is the acceptance of industry. This thesis presents some model-based methodologies for modelling and verification of the French railway interlocking systems (RIS). The first issue is the modellization of interlocking system by coloured Petri nets (CPNs). A generic and compact modelling framework is introduced, in which the interlocking rules are modelled in a hierarchical structure while the railway layout is modelled in a geographical perspective. Then, a modelling pattern is presented, which is a parameterized model respecting the French national rules. It is a reusable solution that can be applied in different stations. Then, an event-based concept is brought into the modelling process of low-level part of RIS to better describe internal interactions of relay-based logic. The second issue is the transformation of coloured Petri nets into B machines, which can help designers on the way from analysis to implementation. Firstly, a detailed mapping methodology from non-hierarchical CPNs to abstract B machine notations is presented. Then the hierarchy and the transition priority of CPNs are successively integrated into the mapping process, in order to enrich the adaptability of the transformation. This transformation is compatible with various types of colour sets and the transformed B machines can be automatically proved by Atelier B. All these works at different levels contribute towards a global safe analysis framework
APA, Harvard, Vancouver, ISO, and other styles
5

Nolibé, Gilles. "Developpement d'une methodologie de determination d'operateurs de calcul specifiques dans des problemes d'identification et d'estimation en temps reel." Toulon, 1988. http://www.theses.fr/1988TOUL0001.

Full text
Abstract:
Elaboration d'une description algebrique des flux de donnees representatifs du traitement algorithmique de signal. Pour cela, une formulation de ces flux qui tient compte de l'ordonnancement des processus afin de determiner le parallelisme interne des algorithmes a implanter. Les resultats theoriques obtenus ont ete appliques a des problemes de traitement de signal
APA, Harvard, Vancouver, ISO, and other styles
6

Siqueira, Ricardo Alves de. "Proposta de metodologia para modelagem e análise de sistemas para controle de geração de energia elétrica." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-26082015-155340/.

Full text
Abstract:
A importância da geração de energia elétrica hidráulica, dentro dos requisitos de qualidade e fornecimento com índices de confiabilidade cada vez mais exigentes, tem se tornada acentuada, principalmente em atendimento às necessidades de consumo em todas as áreas de atividades produtivas. Têm-se notado que as tecnologias desenvolvidas aliadas às mudanças socioeconômicas trouxeram uma evolução e reestruturação, tanto no setor industrial produtivo como no setor elétrico (concessionárias de energia elétrica e fornecedores de sistemas e equipamentos para usinas hidrelétricas e subestações), com aumento significativo da especialização e da complexidade da automação dos processos envolvidos, onde falhas são consideradas inaceitáveis. Em consequência, têm-se exigido soluções técnicas eficazes e com investimentos reduzidos. Desta forma, a Automação Elétrica, que faz parte dos sistemas de Comando, Controle, Comunicação e Informação altamente integrados (C3I), têm demonstrado uma participação fundamental no atual cenário deste segmento. Então, de maneira a tratar adequadamente esta complexidade, tornar as soluções técnicas cada vez mais seguras e facilitar o estudo e projeto de novos sistemas de controle nesta área, este trabalho apresenta uma metodologia para modelagem e análise de Sistemas de Controle envolvidos na geração hidráulica de energia elétrica. Este trabalho tem como principais desenvolvimentos: uma metodologia que envolve a teoria de controle de SDED juntamente com conceitos e pesquisas na área de Engenharia de Software e um formalismo em Rede de Petri Interpretada por Sinais (RPIS) em conjunto com o paradigma de Orientação a Objetos (OO), representado pela proposta de uma nova RP, a RPIS_OO (Rede de Petri Interpretada por Sinais Orientada a Objetos). Destarte, espera-se que a metodologia e a nova RP propostas nesta tese contribuam na especificação e construção dos algoritmos de controle dos sistemas que participam na automação da geração de energia elétrica hidráulica, como também, no aprimoramento de novas abordagens para o desenvolvimento de sistemas de automação elétrica, representando atualmente o estado da arte nesta área.
The importance of hydroelectric power generation, considering the increasingly demanding supply and quality requirements, has become more pronounced especially seeing the great consumption needs on all productive areas. It\'s noticeable that technology developed with socioeconomic changes have brought evolution and a restructuring both in the industrial and electrical sector (electric companies and power plant equipment manufacturers), with a notable increase in specialization and complexity of the automation of these activities, where faults are considered unacceptable. A demand for more efficient technical solutions and reduced investments has therefore increased greatly. Electrical automation technology as part of highly integrated command, control, communication and information (C3I) systems has demonstrated a crucial involvement in the context of this segment. In order to handle this evolving complexity, creating more secure technical solutions and further research and development of new control systems for this sector, this work introduces a new methodology for modeling and analysis of power plant control systems. A methodology involving the theory of Discrete Event Dynamic Systems (DEDS) and concepts of Software Engineering is presented, as well as a new formalism based on Signal Interpreted Petri Nets (SIPN) together with Object-Oriented Paradigm (OOP) named Object-Oriented Signal Interpreted Petri Nets (OOSIPN). The intention is that methodology proposed in this thesis contributes to the correct specification and construction of control algorithms for power plant control systems, as well as the state of the art in this research area in the form of a new approach to development of such automation systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Oancea, Ionela. "Topological analysis of metabolic and regulatory networks by decomposition methods." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät I, 2004. http://dx.doi.org/10.18452/15024.

Full text
Abstract:
Die lebenden Organismen sind für eine wissenschaftliche Analyse zu kompliziert, wenn man sie als Ganzes und in ihrer vollen Komplexität betrachtet. Die vorliegende Arbeit behandelt die topologischen Eigenschaften von zwei wichtigen Teilen der lebenden Organismen: die metabolischen und die regulatorischen Systeme. Topolgische Eigenschaften sind solche, die durch die Netwerkstruktur bedingt werden. Ein Signalsystem ist eine spezielle Art von regulatorischem System. Zwischen den metabolischen und Signalnetzen gibt es wichtige Unterschiede, die ihre Behandlung in unterschiedlicher Weise erfordert. In der metabolischen Pfadanalyse ist das Konzept der elementaren Flussmoden bereits als ein passendes Instrument für die Charakterisierung der einfachsten essentiellen Wege in biochemischen Systemen etabliert. Wir untersuchen die Eigenschaften und Vorteile dieses Konzepts in einigen besonderen Fällen. Zuerst untersuchen wir die vielfach vorkommenden Enzyme mit niedriger Spezifität (z.B. Nukleosiddiphosphokinase, Uridinkinase, Transketolase, Transaldolase). Sie können parallel verschiedene Substrate und Produkte umwandeln. Auch die Enzym-Mechanismen sind vielfältig, wie wir mit dem Reaktionsschema für bifunktionelle Enzyme veranschaulichen. Wir betrachten dabei nur den Fall, dass ein bestimmtes aktives Zentrum mehrere Reaktionen katalysiert. Der Fall, dass das studierte Enzym mehrere solche aktiven Zentren hat, kann in den Fall mehrerer Enzyme transformiert werden, die nur ein aktives Zentrum haben. Wenn eine Krankheit das Ausgangsenzym ändert, werden dann in der Analyse auch alle ersetzenden Enzyme geändert. Es gibt zwei unterschiedliche Betrachtungsweisen, um multifunktionelle Enzyme zu beschreiben. Zum einen kann man die Gesamtreaktionen betrachten und zum anderen die elementaren Reaktionsschritte (Hemireaktionen, Halbreaktionen). Für Enzyme mit zwei oder mehr Funktionen ist es wichtig, nur linear unabhängige Funktionen zu betrachten, weil sonst zyklische elementare Moden auftreten würden, die keine Nettoumwandlung durchführen. Jedoch ist die Wahl der linear unabhängigen Funktionen nicht a priori eindeutig. Wir stellen eine Methode für das Treffen dieser Wahl vor, indem wir die konvexe Basis des Hemireaktions-Systems betrachten. Eine formale Anwendung des Algorithmus für das Berechnen der elementaren Flussmoden (Routen) erbringt das Resultat, dass die Zahl solcher Moden manchmal vom Niveau der Beschreibung abhängt, wenn einige Reaktionen reversibel sind und die Produkte der multifunktionellen Enzyme externe Metabolite sind, oder einige multifunktionelle Enzyme zum Teil die gleichen Stoffwechselprodukte umwandeln. Jedoch kann dieses Problem durch eine geeignete Deutung der Definition der elementaren Moden und die korrekte Wahl der unabhängigen Funktionen der Multifunktionsenzyme gelöst werden. Die Analyse wird durch einige kleinere Beispiele und ein größeres biochemisches Beispiel veranschaulicht, das aus dem Nukleotidmetabolismus stammt und die zwei Arten der Beschreibung für Nukleosiddiphosphokinase und Adenylatekinase vergleicht. Der Nukleotidmetabolismus spielt eine wichtige Rolle in lebenden Organismen und ist gegenüber allen möglichen Störungen in seiner internen Balance sehr empfindlich. Gefährliche Krankheiten können auftreten, wenn einige Enzyme nicht richtig funktionieren. Mit Hilfe des Konzeptes des elementaren Flussmodus erklären wir das Auftreten und den Schweregrad von Krankheiten, die auf Enzymdefizienzen basieren. Wenn ein Enzym vollständig gehemmt wird, werden einige metabolische Wege blockiert. Wenn jedoch einige alternative Wege noch bestehen, ist die Krankheit weniger gefährlich. Unsere Analyse ist darauf gerichtet, alternative Wege, wesentliche Enzyme und solche Enzyme, die immer zusammenarbeiten zu finden. Der letzte Begriff ist auch als "Enzyme subset" bekannt und stellt einen intermediären Schritt im Algorithmus zur Berechnung der elementaren Flussmoden dar. Wir diskutieren bereits bekannte und bisher nur hypothetische Mechanismen einiger Krankheiten (proliferative Krankheiten, Immundefizienzen), die auf Störungen des Nukleotidmetabolismus oder seiner Ausbeutung durch Viren und Parasiten beruhen. Die meisten Strategien, die für das Bekämpfen solcher Krankheiten eingesetzt werden, basieren auf der Unterbrechung des Nukleotidmetabolismus an bestimmten Stellen. Diese Strategien können aber auch zur Akkumulation toxischer Stoffe führen und dadurch Nebenwirkungen hervorrufen. Deswegen hilft ein besseres Verständnis dieses Systems, wirkungsvollere Medikamente zu entwickeln, und eine gute strukturelle Analyse kann viele experimentelle Bemühungen ersparen. Konzepte aus der Theorie der Petri-Netze liefern zusätzliche Werkzeuge für das Modellieren metabolischer Netzwerke. In Kapitel 4 werden die ähnlichkeiten zwischen einigen Konzepten in der traditionellen biochemischen Modellierung und analogen Konzepten aus der Petri-Netztheorie besprochen. Zum Beispiel entspricht die stochiometrische Matrix eines metabolischen Netzwerkes der Inzidenzmatrix des Petri-Netzes. Die Flussmoden und die Erhaltungs-Relationen haben die T-Invarianten beziehungsweise P-Invarianten als Gegenstücke. Wir decken die biologische Bedeutung einiger weiterer Begriffe aus der Theorie der Petri-Netze auf, nämlich "traps", "{siphons", "deadlocks" und "Lebendigkeit". Wir konzentrieren uns auf der topologischen Analyse anstatt auf die Analyse des dynamischen Verhaltens. Die geeignete Behandlung der externen Stoffwechselprodukte wird ebenfalls besprochen. Zur Illustration werden einige einfache theoretische Beispiele vorgestellt. Außerdem werden einige Petri-Netze präsentiert, die konkreten biochemischen Netzen entsprechen, um unsere Resultate zu belegen. Zum Beispiel wird die Rolle der Triosephosphatisomerase (TPI) im Metabolismus von Trypanosoma brucei ausgewertet, indem "traps" und "siphons" ermittelt werden. Alle behandelten Eigenschaften von Petri-Netzen werden anhand eines Systems illustriert, das aus dem Nukleotidmetabolismus stammt. Während viele Bemühungen für das Zerlegen metabolischer Systeme, (elementare Flußmoden, extreme Wege) erfolgt sind, sind bisher unseres Wissens keine Versuche in dieser Richtung für Signalübertragungssysteme unternommen worden. Eine spezielle Eigenschaft von Signalnetzwerken in lebenden Zellen ist, dass Aktivierungen, Hemmungen und biochemische Reaktionen normalerweise gleichzeitig anwesend sind. Selbst wenn sie nicht Reaktionen enthalten, machen Mehrfach-Aktivierungen oder Mehrfach-Hemmungen die Netzwerke in hohem Grade verzweigt. Es ist eine schwierige und sehr zeitraubende Aufgabe, alle Faktoren, die einen Einfluss auf ein gegebenes Ziel haben, ohne eine automatische Methode zu ermitteln. Bereits in Kapitel 1 heben wir die ähnlichkeiten und Unterschiede zwischen den metabolischen und Signal-Netzwerken hervor. In Kapitel 5 errichten wir einen Rahmen und präsentieren einen Algorithmus für die Zerlegung von Signalnetzwerken in kleinere Einheiten, die einfacher zu studieren und zu verstehen sind. Zwei Fälle werden untersucht: ein einfacheres, wenn nur monomolekulare Aktivierungen oder Reaktionen anwesend sind, und ein komplizierterer Fall, wenn die Aktivierungen und die Reaktionen multimolekular sein können. Ihre Beschreibung erfordert unterschiedliche Methoden: klassische Graphen bzw. Petrinetze. Wir besprechen die Probleme, die in unserem Modell wegen des Vorhandenseins von Hemmungen oder von unbekannten Effekten im Netz auftreten. Der vorgeschlagene Algorithmus ermittelt die Faktoren, die zusammenwirken und die Zielsubstanzen, die auf dem gleichen Weg beeinflusst werden. Die Zyklen, die im System auftreten, und mögliche fehlende Reaktionen werden ebenfalls ermittelt . Theoretische Beispiele veranschaulichen unsere Resultate. Anhand der T-Zell-Antigen-Rezeptor-Signalkaskade zeigen wir, wie die Methoden in realen Systemen angewendet werden können.
The living organisms are too complex when considering them as a whole. The present thesis deals with the topological properties of two important parts of living organisms: the metabolic and the regulatory systems. The topological properties are those features that are determined by the network structure. A classification in metabolic and regulatory systems is often used. A signalling system is a special kind of regulatory system. Between metabolic and signalling networks, there are important differences that impose their treatment in different ways. In metabolic pathway analysis, the elementary flux mode concept is already established as a proper tool for identifying the smallest essential routes in biochemical systems. We examine its features and advantages in some particular cases. Firstly, many enzymes operate with low specificity (e.g. nucleoside diphosphokinase, uridine kinase, transketolase, transaldolase), so that various substrates and products can be converted. Also the enzymatic mechanisms are diverse, as we have illustrated with reaction schemes for bifunctional enzymes. Therefore, there are two different approaches to describe multifunctional enzymes (We considered only the case when a certain active site hosts several reactions. The case when the studied enzyme has several such active sites can be transformed into that of several enzymes having only one active site. If a disease alters the initial enzyme, also all substituting enzymes are altered.): in terms of overall reactions and in terms of reactions steps (hemi-reactions, half-reactions). For enzymes with two or more functions, it is important to consider only linearly independent functions, because otherwise cyclic elementary modes would occur which do not perform any net transformation. However, the choice of linearly independent functions is not a priori unique. In Chapter 2, we give a method for making this choice unique by considering the convex basis of the hemi-reactions system. The set of linearly independent functions provided by our algorithm coincides, in the case of transketolase in pentose phosphate pathway, with the set of linearly independent functions mentioned in literature. A formal application of the algorithm for computing elementary flux modes (pathways) yields the result that the number of such modes sometimes depends on the level of description if some reactions are reversible and the products of the multifunctional enzymes are external metabolites or some multifunctional enzymes partly share the same metabolites. However, this problem can be solved by appropriate interpretation of the definition of elementary modes and the correct choice of independent functions of multifunctional enzymes. The analysis is illustrated by a biochemical example taken from nucleotide metabolism, comparing the two ways of description for nucleoside diphosphokinase and adenylate kinase, and by several smaller examples. The nucleotide metabolism plays an important role in living organisms and is very sensitive to any perturbations in its internal balance. Dangerous diseases may occur if some enzymes do not work properly. With the help of elementary flux mode concept, we explain the occurrence and severity of diseases based on enzyme deficiencies. If an enzyme is completely inhibited, some metabolic routes are blocked. If, however, some alternative routes still exist, the disease is less dangerous. In Chapter 3, we focus on finding alternative routes, essential enzymes and enzymes operating together. The latter notion is also known as ,,enzyme subset`` and represents an intermediary step in calculating the elementary flux modes. The known or hypothesised mechanisms of several disorders, occurred due to the malfunctioning of nucleotide metabolism (proliferative diseases, immunodeficiency diseases) or due to its hijacking by viruses and parasites, are given. Most strategies adopted for curing such diseases are based on nucleotide metabolism interruption. Therefore, a better understanding of this system helps developing more effective drugs and a good structural analysis can spare many experimental efforts. Petri net concepts provide additional tools for the modelling of metabolic networks. In Chapter 4, the similarities between the counterparts in traditional biochemical modelling and Petri net theory are discussed. For example, the stoichiometry matrix of a metabolic network corresponds to the incidence matrix of the Petri net. The flux modes and conservation relations have the T-invariants, respectively, P-invariants as counterparts. We reveal the biological meaning of some notions specific to the Petri net framework (traps, siphons, deadlocks, liveness). We focus on the topological analysis rather than on the analysis of the dynamic behaviour. The treatment of external metabolites is discussed. Some simple theoretical examples are presented for illustration. Also the Petri nets corresponding to some biochemical networks are built to support our results. For example, the role of triose phosphate isomerase (TPI) in Trypanosoma brucei metabolism is evaluated by detecting siphons and traps. All Petri net properties treated in above-mentioned chapter (4) are exemplified on a system extracted from nucleotide metabolism. While for decomposing metabolic systems, many efforts have been done (elementary flux modes, convex basis, extreme pathways), for signalling maps, as far as we know, no attempt in this direction has been made. A special characteristic of signalling networks is that activations, inhibitions, and biochemical reactions are normally present in parallel. Even if they do not contain reactions, multi-part activations or inhibitions make them highly branched. To detect all factors that have an influence on a given target, without using an automatic method, is a difficult and very time-consuming effort. Already in Chapter 1 (Backgrounds), we highlight the similarities and differences between metabolic and signalling networks. In Chapter 5, we build a framework and algorithm for decomposing signalling networks in smaller units, which are easier to study and understand. Two cases are investigated: a simpler one, when only monomolecular activations or reactions are present, and a more complex case, when the activations and reactions can be multimolecular. Their description requires different instruments: classical graphs and Petri nets, respectively. We discuss the problems that occur in our model due to the presence of some inhibitions or unknown effects in the network. The algorithm that we propose detects the factors that are acting together and the targets that are affected on the same route. The cycles that occur in the system are also highlighted. We point out possible missing reactions. Theoretical examples illustrate out findings. Using the T cell antigen-receptor signalling cascade, we show how it can be applied to real systems.
APA, Harvard, Vancouver, ISO, and other styles
8

Wist, Dominic, Mark Schaefer, Walter Vogler, and Ralf Wollowski. "STG decomposition : internal communication for SI implementability." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4078/.

Full text
Abstract:
STG decomposition is a promising approach to tackle the complexity problems arising in logic synthesis of speed independent circuits, a robust asynchronous (i.e. clockless) circuit type. Unfortunately, STG decomposition can result in components that in isolation have irreducible CSC conflicts. Generalising earlier work, it is shown how to resolve such conflicts by introducing internal communication between the components via structural techniques only.
STG-Dekomposition ist ein bewährter Ansatz zur Bewältigung der Komplexitätsprobleme bei der Logiksynthese von SI (speed independent) Schaltungen – ein robuster asynchroner (d.h. ohne Taktsignal arbeitender digitaler) Schaltungstyp. Allerdings können dabei Komponenten mit irreduziblen CSC-Konflikten entstehen. Durch Verallgemeinerung früherer Arbeiten wird gezeigt, wie solche Konflikte durch Einführung interner Kommunikation zwischen den Komponenten gelöst werden können, und zwar ausschließlich durch Verwendung an der Graphenstruktur ansetzender Verfahren.
APA, Harvard, Vancouver, ISO, and other styles
9

Grunwald, Stefanie. "Identifizierung und Charakterisierung von Muskeldystrophie Duchenne modifizierenden Genen und Stoffwechselwegen." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät I, 2010. http://dx.doi.org/10.18452/16108.

Full text
Abstract:
Hintergrund und Zielsetzung: DMD ist die häufigste Form der Muskeldystrophie im Kindesalter und bis heute unheilbar. Sie wird durch das Fehlen des Proteins Dystrophin verursacht, welches verschiedene Signaltransduktionswege beeinflusst. Das Anliegen der Arbeit ist die Untersuchung und Modulation von Signaltransduktionswegen, die als alternative Therapiestrategie den Verlust von Dystrophin kompensieren könnten. Experimentelle Strategie: Für die Charakterisierung von Dystrophin nachgeschalteten Prozessen wurden mRNA-Expressionsanalysen in Muskelgeweben von DMD-Patienten und einem DMD-Brüderpaar mit einem infrafamiliär unterschiedlichen Verlauf der DMD durchgeführt. Aus diesen Expressionsdaten wurde erstmalig ein Petri-Netz entwickelt, welches Dystrophin mit in diesem Zusammenhang bisher unbekannten Signaltransduktionswegen verknüpft. Das Petri-Netz wurde auf Netzwerkintegrität und –verhalten mittels Invarianten- (INA) und theoretischen Knockout- (Mauritius Maps) Analysen untersucht. Durch beide Methoden läßt sich der maßgebliche Teilsignalweg bestimmen. In diesem Signalweg wurden die Proteinaktivität und die Genexpression durch siRNA, Vektor-DNA und chemische Substanzen in humanen SkMCs moduliert. Anschließend wurden die Proliferation und die Vitalität der Zellen sowie auch die Expression auf mRNA- und Protein-Niveau untersucht. Ergebnisse: RAP2B und CSNK1A1 waren in dem DMD-Brüderpaar differentiell exprimiert und konnten erstmalig in einem neuen, komplexen Signalweg in Zusammenhang mit Dystrophin nachgeschalteten Prozessen dargestellt werden. Mittelpunkt dieses Signalweges ist die De- und Aktivierung des Transkriptionsfaktors NFATc. Seine Zielgene umfassen neben anderen den negativen Proliferationsfaktor p21, das Dystrophin homologe UTRN und den Differenzierungsfaktor MYF5. Folglich würde ein Anstieg von UTRN eine unerwünschte Reduktion der Proliferationsrate von Myoblasten implizieren. Letzteres konnte bereits nachgewiesen werden und stellte das Motiv für weitere Studien dar. Jedoch zeigten siRNA- und Vektor-DNA-Experimente, daß NFATc nicht der ausschlaggebende Faktor für diese Zielgene ist. Die Substanzen Deflazacort (DFZ) und Cyclosporin A (CsA) wurden dagegen beschrieben, die Aktivierung von NFATc zu beeinflussen. Die Ergebnisse zeigten, daß beide Substanzen die Proliferation von Myoblasten erhöhen können. Die gleichzeitige Applikation von DFZ und CsA führte zu einem Anstieg der UTRN-Expression. Schlußfolgerung: Die Modulation der Proliferation und UTRN-Expression ist unabhängig von einander möglich. Entsprechend der Grundidee der Arbeit zeichnet sich eine neue Therapiestrategie ab, welche Dystrophin nachgeschaltete Prozesse einbezieht.
Background and aim: DMD is the most common muscular dystrophy in childhood and incurable to date. It is caused by the absence of dystrophin, what influences several signal transduction pathways. The thesis is interested in the investigation and modulation of signal transduction pathways that may compensate the lack of dystrophin as an alternative therapy strategy. Experimental strategy: To study Dystrophin downstream pathways the mRNA expression of DMD patients and two DMD siblings with an intra-familially different course of DMD were analysed in muscle tissue. On the basis of these expression data a Petri net was first developed implicating signal transduction pathways and Dystrophin downstream cascades. Invariant (INA) and theoretical knockout (Mauritius Maps) analyses were applied for studying network integrity and behaviour. Both methods provide information about the most relevant part of the network. In this part modulation of protein activity and of gene expression using siRNA, vector-DNA, and chemical substances were performed on human SkMCs. Subsequently, the cells were studied by proliferation and vitality tests as well as expression analyses at mRNA and protein level. Results: RAP2B and CSNK1A1 were differently expressed in two DMD siblings, and first are part of a signal transduction pathway implicating Dystrophin downstream processes. The central point of this pathway is the de- and activation of the transcription factor NFATc. Its target genes are, among others, the negative proliferation factor p21, the Dystrophin homologue UTRN, and the differentiation factor MYF5. Consequently, an increase in UTRN implicates an undesirably reduced myoblast proliferation rate. Latter was found in DMD patients and was target for further studies. But, siRNA and vector DNA experiments showed that NFATc is not the decisive factor for the target genes. Deflazacort and cyclosporin A are known to influence the activation of NFATc. The results first showed that both substances do induce myoblast proliferation. The use of deflazacort in combination with cyclosporin A resulted in an increase of UTRN expression. Conclusion: The modulation of proliferation and UTRN-expression independently of each other is possible. According to the basic idea of this study, a new therapeutic strategy becomes apparent, which considers Dystrophin downstream processes.
APA, Harvard, Vancouver, ISO, and other styles
10

Costantini, Hervé. "La mobilité sociale : Modèles et traces." Phd thesis, Conservatoire national des arts et metiers - CNAM, 2012. http://tel.archives-ouvertes.fr/tel-00770978.

Full text
Abstract:
L'avenir de la communication est perçu comme étant quasiment exclusivement constitué de nœuds mobiles évoluant dans un réseau mobile. Dans ce contexte, différentes approches contribuent continuellement à l'amélioration directe ou indirecte des délais d'acheminement des informations échangées entre les utilisateurs, dont :- l'analyse des traces;- l'évaluation des performances ;- les services de localisation;- le routage. Nous décrivons chacun de ses thèmes et proposons des solutions faisant évoluer l'état de l'art. Celles-ci prennent appui sur des méthodes et outils tels que :- les Réseaux de Petri, pour l'analyse des traces ;- les modèles de mobilité, pour l'évaluation des performances;- l'introduction du social dans les services de localisation;- la mise en place d'une nouvelle métrique pour le routage. Nous montrons comment ces solutions concourent de façon complémentaire les unes avec les autres, à améliorer l'expérience de l'utilisateur.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "SIGNED PETRI NETS"

1

Center, Langley Research, ed. Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Center, Langley Research, ed. Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SIGNED PETRI NETS"

1

Blunno, Ivan, and Luciano Lavagno. "Deriving Signal Transition Graphs from Behavioral Verilog HDL." In Hardware Design and Petri Nets, 151–70. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3143-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Meyer, R., and P. S. Thiagarajan. "LTrL-Based Model Checking for a Restricted Class of Signal Transition Graphs." In Hardware Design and Petri Nets, 93–106. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3143-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Klein, Stéphane, Georg Frey, and Mark Minas. "PLC Programming with Signal Interpreted Petri Nets." In Applications and Theory of Petri Nets 2003, 440–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44919-1_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Juhás, Gabriel, Robert Lorenz, and Christian Neumair. "Modelling and Control with Modules of Signal Nets." In Lectures on Concurrency and Petri Nets, 585–625. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27755-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chung, Suck-Heui, and Steve Furber. "The Design of the Control Circuits for an Asynchronous Instruction Prefetch Unit Using Signal Transition Graphs." In Hardware Design and Petri Nets, 171–90. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3143-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Little, Scott, David Walter, Nicholas Seegmiller, Chris Myers, and Tomohiro Yoneda. "Verification of Analog and Mixed-Signal Circuits Using Timed Hybrid Petri Nets." In Automated Technology for Verification and Analysis, 426–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30476-0_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Souza, Layse Santos, and Michel S. Soares. "Combining SysML with Petri Nets for the Design of an Urban Traffic Signal Control." In Computational Science and Its Applications – ICCSA 2021, 115–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87013-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boisseau, Guillaume, and Robin Piedeleu. "Graphical Piecewise-Linear Algebra." In Lecture Notes in Computer Science, 101–19. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_6.

Full text
Abstract:
AbstractGraphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri nets and electrical circuits. In this paper, we introduce to the family its most expressive member to date: Graphical Piecewise-Linear Algebra, a new language to specify piecewise-linear subsets of vector spaces.Like the previous members of the family, it comes with a complete axiomatisation, which means it can be used to reason about the corresponding semantic domain purely equationally, forgetting the set-theoretic interpretation. We show completeness using a single axiom on top of Graphical Polyhedral Algebra, and show that this extension is the smallest that can capture a variety of relevant constructs.Finally, we showcase its use by modelling the behaviour of stateless electronic circuits of ideal elements, a domain that had remained outside the remit of previous diagrammatic languages.
APA, Harvard, Vancouver, ISO, and other styles
9

Napione, Lucia, Daniele Manini, Francesca Cordero, András Horváth, Andrea Picco, Massimiliano De Pierro, Simona Pavan, et al. "On the Use of Stochastic Petri Nets in the Analysis of Signal Transduction Pathways for Angiogenesis Process." In Computational Methods in Systems Biology, 281–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03845-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Banham, Adam, Sander J. J. Leemans, Moe T. Wynn, and Robert Andrews. "xPM: A Framework for Process Mining with Exogenous Data." In Lecture Notes in Business Information Processing, 85–97. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98581-3_7.

Full text
Abstract:
AbstractProcess mining facilitates analysis of business processes using event logs derived from historical records of process executions stored in organisations’ information systems. Most existing process mining techniques only consider data directly related to process execution (endogenous data). Data not directly representable as attributes of either events or traces (which includes exogenous data), are generally not considered. Exogenous data may be used by process participants in making decisions about execution paths. However, as exogenous data is not represented in event logs, its impact on such decision making is opaque and cannot currently be assessed by existing process mining techniques. This paper shows how exogenous data can be used in process mining, in particular discovery and enhancement techniques, to understand its influence on process decisions. In particular, we focus on time series which represent periodic observations of e.g. weather measurements, city health alerts or patient vital signs. We show that exogenous time series can be aligned and transformed into new attributes to annotate events in an event log. Then, we use these attributes to discover preconditions in a Petri net with exogenous data (xDPN), thus revealing the exogenous data’s influence on the process. Using our framework and a real-life data set from the medical domain, we evaluate the influence of exogenous data on decision points that are non-deterministic in an xDPN.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SIGNED PETRI NETS"

1

Ikeda, Yuta, and Takao Miura. "Prototyping Color Timed Petri Nets." In 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PacRim). IEEE, 2011. http://dx.doi.org/10.1109/pacrim.2011.6032953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Minas, M., and G. Frey. "Visual PLC-programming using signal interpreted Petri nets." In Proceedings of 2002 American Control Conference. IEEE, 2002. http://dx.doi.org/10.1109/acc.2002.1025461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zheng, Chengwei, John McAllister, and Roger Woods. "Regular-choice Petri Nets for MIMO detectors." In 2010 IEEE Workshop On Signal Processing Systems (SiPS). IEEE, 2010. http://dx.doi.org/10.1109/sips.2010.5624786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aspar, Z., Mohamed Khalil-Hani, and Nasir Shaikh-Husin. "Deadlock detection and avoidance using Signal Interpreted Petri Nets." In 2012 IEEE International Conference on Circuits and Systems (ICCAS). IEEE, 2012. http://dx.doi.org/10.1109/iccircuitsandsystems.2012.6408338.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Po-Yuan Shih, Dong-Her Shih, Shin-Yuan Hung, and Ming-Hung Shih. "A rough Petri nets model for stock trading signal detection." In 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA). IEEE, 2016. http://dx.doi.org/10.1109/icccbda.2016.7529547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ungaretti Borges, Matheus, and Eduardo Lima II. "IMPLEMENTATION OF SIGNAL INTERPRETED PETRI NETS USING C LANGUAGE IN ARDUINO." In 24th ABCM International Congress of Mechanical Engineering. ABCM, 2017. http://dx.doi.org/10.26678/abcm.cobem2017.cob17-0418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Little, Scott, Nicholas Seegmiller, David Walter, Chris Myers, and Tomohiro Yoneda. "Verification of Analog/Mixed-Signal Circuits Using Labeled Hybrid Petri Nets." In 2006 IEEE/ACM International Conference on Computer Aided Design. IEEE, 2006. http://dx.doi.org/10.1109/iccad.2006.320148.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Little, Scott, Nicholas Seegmiller, David Walter, Chris Myers, and Tomohiro Yoneda. "Verification of analog/mixed-signal circuits using labeled hybrid petri nets." In the 2006 IEEE/ACM international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1233501.1233556.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Köhler, Andreas, and Ping Zhang. "Pareto Modeling of Discrete Manufacturing Systems by Signal Interpreted Petri Nets." In 2023 American Control Conference (ACC). IEEE, 2023. http://dx.doi.org/10.23919/acc55779.2023.10155912.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Farah, Khamsa, Karim Chabir, and Mohamed Naceur Abdelkrim. "A Petri Nets Modeling of Scheduling Policies in Ethernet Switch." In 2019 International Conference on Signal, Control and Communication (SCC). IEEE, 2019. http://dx.doi.org/10.1109/scc47175.2019.9116135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography