scientific article; zbMATH DE number 1341754
From MaRDI portal
Publication:4263299
zbMath0934.93037MaRDI QIDQ4263299
Enrique Teruel, Manuel Silva, Laura Recalde
Publication date: 27 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reachabilitylivenessPetri netsdeadlock-freenessP/T netsfree choice netsequal conflict netsfractional firingsnon-discrete markings
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)
Related Items (17)
Optimal stationary behavior for a class of timed continuous Petri nets ⋮ Basic server semantics and performance monotonicity of continuous Petri nets ⋮ Individuals, populations and fluid approximations: a Petri net based perspective ⋮ Approximation of the asymptotic mean marking of SPNs with contPNs ⋮ Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling ⋮ About the stochastic and continuous Petri nets equivalence in the long run ⋮ Computing with chemical reaction networks: a tutorial ⋮ Continuous Petri Nets: Expressive Power and Decidability Issues ⋮ Piecewise constant timed continuous PNs for the steady state estimation of stochastic PNs ⋮ On Controllability of Timed Continuous Petri Nets ⋮ Tracking control of join-free timed continuous Petri net systems under infinite servers semantics ⋮ 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 ⋮ Occam's razor applied to the Petri net coverability problem ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph
This page was built for publication:
