For the most recent entries see the Petri Nets Newsletter.

Properties of change diagrams.

Schwiegelshohn, U.; Thiele, L.

In: Yakovlev, A.; Gomes, L.; Lavagno, L.: Hardware Design and Petri Nets, pages 77-92. Boston: Kluwer Academic Publishers, 2000.

Abstract: The paper investigates properties of change diagrams. They are able to model a subclass of concurrent systems, for example asynchronous circuits or timing diagrams. The following results are described: Change diagrams are related to the class of dynamic min-max graphs. Efficient algorithms for timing analysis are derived. Liveness and boundedness properties are investigated.

Keywords: asynchronous circuits, change diagrams, dynamic min-max graphs, timing analysis, timed change diagrams..


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography