Sciweavers

APN
1993
Springer
13 years 12 months ago
Transient Analysis of Deterministic and Stochastic Petri Nets
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with ...
Hoon Choi, Vidyadhar G. Kulkarni, Kishor S. Trived...
APN
1994
Springer
13 years 12 months ago
Modelling the Work Flow of a Nuclear Waste Management Program
In this paper we describe a modelling project to improve a nuclear waste management program in charge of the creation of a new system for the permanent disposal of nuclear waste. S...
Kjeld Høyer Mortensen, Valerio O. Pinci
APN
1994
Springer
13 years 12 months ago
On the Model of Computation of Place/Transition Petri Nets
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...
José Meseguer, Ugo Montanari, Vladimiro Sas...
APN
1994
Springer
13 years 12 months ago
Coloured Petri Nets Extended with Channels for Synchronous Communication
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are...
Søren Christensen, Niels Damgaard Hansen
AISC
1994
Springer
13 years 12 months ago
Using Commutativity Properties for Controlling Coercions
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...
Stephan A. Missura, Andreas Weber
AISB
1994
Springer
13 years 12 months ago
An Empirical Comparison of Selection Methods in Evolutionary Algorithms
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Peter J. B. Hancock
LATA
2010
Springer
13 years 12 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman