## TIMED PETRI NETS Petri nets were developed as an operational formalism for specifying untimed concurrent systems. They can show concurrent activities by depicting control and data flows in different parts of the modeled system. As an operational formalism, a Petri net gives a dynamic representa
CTS systems and Petri nets
β Scribed by Ij.J. Aalbersberg; G. Rozenberg
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 837 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the theoretical analysis of Petri nets there are many results for subclasses of Petri nets restricted by structural or behavioral properties. Recently, new types of analytical methods that are not restricted to special classes of Petri nets have been proposed. These methods aim to improve the ave
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent?; (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both t
Kulba, V.V. and A.R. Shvetsov, Using Petri-nets for data processing systems analysis and synthesis, Mathematics and Computers in Simulation 33 (1991) 317-321. The article deals with some problems connected with analysis and synthesis of Data Processing Systems under time criteria. Modelling of a DPS