Autonomous continuous P/T systems

DOI10.1007/3-540-48745-X_8MaRDI QIDQ4263299zbMATH OpenFDO

Authors L. Recalde, E. Teruel, Manuel Silva

Publication date 27 April 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48745-X_8

zbMATH Keywords

deadlock-freenessequal conflict netsfractional firingsfree choice netslivenessnon-discrete markingsP/T netsPetri netsreachability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Review text

Basic definitions of autonomous continuous P/T nets and systems are introduced so as to allow operating with non-discrete markings and fractional firings of transitions. The paper develops a comparative study of the behaviors of discrete and continuous systems, relying on reachability as a central concept for the analysis of logic properties. Two extensions are formulated for the reachability of continuous systems, which can be further exploited when dealing with other properties. The work concentrates on the use of these two extensions in approaching liveness and deadlock-freeness. Stronger results are proved for the particular subclasses of equal conflict nets and free choice nets, respectively. For the entire collection see [Zbl 0915.00049].

Recommendations

• Continuous-time relay self-tuning control
• Autonomy in multivariable systems with discontinuous controls
• scientific article; zbMATH DE number 3242125
• scientific article; zbMATH DE number 3306309
• scientific article; zbMATH DE number 4077078
• scientific article; zbMATH DE number 852186
• scientific article; zbMATH DE number 1999056
• Automated linear analysis of continuous control systems
• Real-time autonomic automation

Cited in

(21)

• Optimal stationary behavior for a class of timed continuous Petri nets
• Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
• On the fluidization of Petri nets and marking homothecy
• ON/OFF strategy based minimum-time control of continuous Petri nets
• Synthesis and reengineering of persistent systems
• Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph
• Individuals, populations and fluid approximations: a Petri net based perspective
• Continuous Petri Nets: Expressive Power and Decidability Issues
• On Controllability of Timed Continuous Petri Nets
• Approximation of the asymptotic mean marking of SPNs with contPNs
• About the stochastic and continuous Petri nets equivalence in the long run
• Piecewise constant timed continuous PNs for the steady state estimation of stochastic PNs
• scientific article; zbMATH DE number 2079874 (Why is no real title available?)
• scientific article; zbMATH DE number 2144772 (Why is no real title available?)
• Complexity analysis of continuous Petri nets
• Computing with chemical reaction networks: a tutorial
• Continuous Petri nets faithfully fluidify most permissive Boolean networks
• DEDS along their life-cycle: interpreted extensions of Petri nets
• On fluidization of discrete event models: Observation and control of continuous Petri nets
• Basic server semantics and performance monotonicity of continuous Petri nets
• Tracking control of join-free timed continuous Petri net systems under infinite servers semantics

This page was built for publication: Autonomous continuous P/T systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263299)