Results 21 to 30 of about 462,160 (174)
Firing Rate Optimization of Deterministic Timed Event Graphs by Server Performance Improvement
IEEE Access, 2018 Timed event graphs are a subclass of Petri nets that are commonly applied for modeling and controlling manufacturing systems. In this paper, we investigate the problem of improving the performance of machines (servers) in timed event graphs in order to ...
Zhou He, Miao Liu, Ning Ran, Zhiwu Li
doaj +1 more source
Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing
Entropy, 2016 Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas.
James (Jong Hyuk) Park, Wanlei Zhou
doaj +1 more source
The Perspective on Data and Control Flow Analysis in Topological Functioning Models by Petri Nets
Applied Computer Systems, 2014 The perspective on integration of two mathematical formalisms, i.e., Colored Petri Nets (CPNs) and Topological Functioning Model (TFM), is discussed in the paper. The roots of CPNs are in modeling system functionality.
Asnina Erika +1 more
doaj +1 more source
Algorithms, logic and modeling of agent-based metacomputer systems with a high level of parallelism
Известия высших учебных заведений. Поволжский регион:Технические науки, 2022 Background. It is proposed to develop agent-based network metacomputer systems and applications based on logical methods and related conceptual graphical models, which allows combining imperative and declarative methods when designing the functional ...
V.I. Volchikhin +3 more
doaj +1 more source
Two Algebraic Process Semantics for Contextual Nets
, 2001 We show that the so-called 'Petri nets are monoids' approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable non-free monoids of places.
SASSONE V. +5 more
core +2 more sources
Axiomatizing Petri Net Concatenable Processes [PDF]
, 1995 The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $P[N]$. Yet, this is only a partial axiomatization, since $P[N]$ is built on a concrete, ad hoc chosen, category of symmetries ...
Sassone, V.
core +2 more sources
Homogeneous Equations of Algebraic Petri Nets
CoRR, 2016 Preprint of Paper accepted for CONCUR 2016 including full ...
Marvin Triebel, Jan Sürmeli
openaire +6 more sources
Algebraic Models for Contextual Nets
, 2000 We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual token philosophy uniformly along the two interpretations of net ...
SASSONE V. +5 more
core +2 more sources
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
BMC Bioinformatics, 2011 Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze
Blekherman Grigoriy +6 more
doaj +1 more source
An algebraic structure of petri nets [PDF]
, 1980 The paper concerns algebraic properties of Petrinets. A wide class of nets, called simple nets, is introduced and a lattice of these nets is defined. It turns out that nets representing sequential systems and processes are atoms of this lattice, and this fact provides the natural way of building nets representing.
openaire +2 more sources