Autonomous Continuous P/T Systems
Discrete event dynamic systems may have extremely large state spaces. For their analysis, it is usual to relax the description by removing the integrality constraints. Applying this idea, continuous P/T systems are defined by allowing fractional firings of transitions, and thus the existence of non-discrete markings [4,5,1]. In this paper we compare the behaviors of discrete and continuous systems, and observe that they are not necessarily similar. The problems that appear lead to the definition of two extensions of reachability. Many properties shall be extended differently depending on which reachability definition is being considered. Here, we concentrate on liveness and deadlock-freeness, proposing extensions and relating them to their discrete counterparts.
KeywordsDiscrete System Continuous System Convergent Subsequence Large State Space Discrete Event Dynamic System
Unable to display preview. Download preview PDF.
- 1.H. Alla and R. David. Continuous and hybrid Petri nets. Journal of Circuits, Systems, and Computers, 8(1), 1998.Google Scholar
- 2.R. Champagnat, P. Esteban, H. Pingaud, and R. Valette. Modeling hybrid systems through by means of high-level Petri nets. benefits and limitations. In M. Ferney, P. Borne, A. El Moudni, and L. Grujic, editors, Proceedings of CIS’97, volume 1, pages 469–474, Belfort, France, 1997.Google Scholar
- 3.R. Champagnat, H. Pingaud, H. Alla, C. Valentin-Roubinet, and J.M. Flaus. A gas storage example as a benchmark for hybrid modelling. In Proc. of ADPM’98, pages 123–130, Reims, France, March 1998.Google Scholar
- 4.R. David and H. Alla. Continuous Petri nets. In Proc. of the 8th European Workshop on Application and Theory of Petri Nets, pages 275–294, Zaragoza, Spain, 1987.Google Scholar
- 5.R. David and H. Alla. Autonomous and timed continuous Petri nets. In Rozenberg , pages 71–90.Google Scholar
- 6.J. Desel and J. Esparza. Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.Google Scholar
- 7.J. Ezpeleta, J.M. Couvreur, and M. Silva. A new technique for finding a generating family of siphons, traps and ST-components. application to coloured Petri nets. In Rozenberg , pages 126–147.Google Scholar
- 8.D. G. Luenberger. Introduction to Linear and non Linear Programming. Addison-Wesley Publishing Company, 1972.Google Scholar
- 11.M. Silva. Towards a synchrony theory for P/T nets. In K. Voss et al., editors, Concurrency and Nets, pages 435–460. Springer, 1987.Google Scholar
- 12.M. Silva, E. Teruel, and J. M. Colom. Linear algebraic techniques for the analysis of net systems. In G. Rozenberg and W. Reisig, editors, Advances in Petri Nets, Lecture Notes in Computer Science. Springer, 1998. To appear.Google Scholar
- 14.K. Trivedi and V. G. Kulkarni. FSPNs: Fluid stochastic Petri nets. In M. Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 24–31. Springer, 1993.Google Scholar
- 15.C. Valentin and P. Ladet. Flow modelling in a class of hybrid (continuous/discrete) systems. In IEEE Int. Conf. on Systems, Man, and Cybernetics, Le Touquet, France, October 1993.Google Scholar