Results 241 to 250 of about 1,247,855 (284)

Passage times in colored stochastic petri nets

Communications in Statistics. Stochastic Models, 1993
Summary: Passage times in colored-stochastic Petri nets correspond to delays in discrete-event stochastic systems. Formal definition of a sequence of passage times in a colored stochastic Petri net is in terms of the underlying general state space Markov chain of the marking process.
Haas, Peter J., Shedler, Gerald S.
openaire   +2 more sources

Modeling With Colored Petri Nets

2019
Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming language ML
Dmitry A. Zaitsev, Tatiana R. Shmeleva
openaire   +1 more source

Verification of OSPF vulnerabilities by colored Petri net

Proceedings of the 6th International Conference on Security of Information and Networks, 2013
Routers and routing protocols are critical parts of a network infrastructure. OSPF is one of the most important routing protocols, and therefore its vulnerabilities can be very destructive. This makes its security analysis critical. There are many reported and potential vulnerabilities in OSPF protocol.
Saeid Tizpaz-Niari, Amir Hossein Jahangir   +1 more
openaire   +1 more source

A colored Petri net model for DisCSP algorithms

Concurrency and Computation: Practice and Experience, 2017
SummaryThe aim of this paper is to present a colored Petri net that models a system applying a DisCSP method. Our study considered 3 representative DisCSP algorithms: synchronous backtracking, asynchronous backtracking, and weak‐commitment search. To obtain the model, it was necessary to transpose the operation of a DisCSP‐based system into a discrete ...
Carlos Pascal, Doru Panescu
openaire   +1 more source

Modeling concurrent programs with colored Petri nets

Journal of Systems and Software, 1994
Abstract We show how colored Petri nets can be used to model concurrent programs. We describe a translation from a substantive subset of Ada including dynamic tasking, subroutines, and generics, constructs that have not been modeled with Petri nets before.
Ryan Stansifer, Mike Beaven, Dan C. Marinescu   +2 more
openaire   +2 more sources

Transforming event graphs to colored petri nets

SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004
The paper explorers a comparison between the two approaches, event graphs and colored Petri nets, in terms of their modeling and simulation capabilities. A methodology for transforming an event graph model of a Discrete Event System (DES) to an equivalent colored Petri net model is presented with an illustration.
Daesik Kim, Abbas K. Zaidi
openaire   +1 more source

Creating executable models of influence nets with colored Petri nets

International Journal on Software Tools for Technology Transfer (STTT), 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee W. Wagenhals, Insub Shin, Alexander H. Levis   +2 more
openaire   +2 more sources

Synthesis of Controllers of Processes Modeled as Colored Petri Nets

Discrete Event Dynamic Systems, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mbi Makungu, Michel Barbeau, Richard St-Denis   +2 more
openaire   +3 more sources

Exploiting colored Petri nets to decide on permutation admissibility

Acta Informatica, 2008
In this work, we propose an innovative approach to investigate the admissibility of permutations to multistage interconnection networks—a challenging problem of switching theory. The proposed approach is centered upon modeling of multistage interconnection networks with colored Petri nets and use of Petri net analysis tools such as the unfolding ...
Rza Bashirov, Fabrice Kordon, Hüseyin Lort   +2 more
openaire   +6 more sources

Quantitative Analysis of Permutation Capability with Colored Petri Nets

13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005
Given a multistage interconnection network (MIN) the calculation of the number of permutations of its input terminals into its output terminals is a classical difficult problem. In this paper, we introduce a novel technique to analyze the permutation capability of a MIN based on Colored Petri Nets (CP-nets or CPNs).
Rza Bashirov, Valentino Crespi
openaire   +1 more source