Verification of closed timed models by explicit state-space exploration methods is an alternative to the wide-spread symbolic techniques based on difference bound matrices (DBMs). A few experiments found in the literature confirm that for the reachability analysis of timed automata explicit techniques can compete with DBM-based algorithms, at least for situations where the constants used in the...

During the development of a production control system, an appropriate model of the production process is needed to evaluate the various control strategies. This paper describes how to apply timed Petri nets and existing production data to the modelling of production systems. Information concerning the structure of a production facility and the products that can be produced is usually given in p...

Timed Petri nets are used as models of cluster tools, representing not only the concurrency activities of different chambers, but also the durations of these activities. Structural analysis, based on net invariants, provides basic performance measures, such as throughput and cycle time. The results are obtained in symbolic form, so many specific variants can easily be compared without repeated ...

D–timed Petri nets are Petri nets with deterministic firing times assigned to transitions of a net. Several classes of D–timed are discussed in this paper to show a hierarchy of models with increasing “modelling power”. Conflict–free inhibitor nets are sufficient to model communication protocols with timeouts used to recover from lost and/or distorted messages but they introduce intermediate st...

Timed Petri-nets are used to model numerous types of large complex systems, especially computer architectures and communication networks. While formal analysis of such models is sometimes possible, discrete-event simulation remains the most general technique available for assessing the model's behavior. However, simulation's computational requirements can be massive, especially on the large com...

26 Connection Machine CM-1 routing network on 16 processors of an Intel iPSC/860, and on a simulation of a slotted-ring architecture that is executed on up to 64 processors of the Intel Touchstone Delta. Signiicant performance beneets are observed, and the eeectiveness of (and need for) dynamic remapping clearly demonstrated. Acknowledgements We thank Subhas Roy for his programming contribution...

Abstra t. The Asyn hronous Transfer Mode (ATM) is a fast pa ket{ swit hing ommuni ation method using small xed-length ells. A model of an ATM LAN is presented whi h provides a realisti representation of data transmission by modeling both the ATM network and the appliations running over it. Colored Petri nets are used to reate a ompa t model that is apable of representing a variety of di erent p...

A Bank ATM is including controller, card authorization system and a teller unit .This paper explains howthis parts connects together. In this paper will be used of a new mode place in Petri nets. More systemsusually have a complex constructs. ATM will be simulated use of new mode place at this study. The Mainpart of this model is used of T.S.Staines model [1]. We discuss how a simple model of T...