scientific article; zbMATH DE number 1302046

zbMath0926.68086MaRDI QIDQ4247289

José-Manuel Colom, Enrique Teruel, Manuel Silva

Publication date: 5 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

place/transition net systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Petri Net Reductions for Counting Markings ⋮ Accelerating the computation of dead and concurrent places using reductions ⋮ On liveness and boundedness of asymmetric choice nets ⋮ Closed-loop live marked graphs under generalized mutual exclusion constraint enforcement ⋮ Individuals, populations and fluid approximations: a Petri net based perspective ⋮ Mathematical programming approach to the Petri nets reachability problem ⋮ A Petri net model for membrane systems with dynamic structure ⋮ Verification of bounded Petri nets using integer programming ⋮ Flexible nets: a modeling formalism for dynamic systems with uncertain parameters ⋮ Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling ⋮ Path planning for robotic teams based on LTL specifications and Petri net models ⋮ Charlie – An Extensible Petri Net Analysis Tool ⋮ Fluid approximation of Petri net models with relatively small populations ⋮ Projection approaches to process mining using region-based techniques ⋮ On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming ⋮ Continuous Petri Nets: Expressive Power and Decidability Issues ⋮ Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques ⋮ Unnamed Item ⋮ A Petri net based approach for multi-robot path planning ⋮ Tracking control of join-free timed continuous Petri net systems under infinite servers semantics ⋮ Current-state opacity modelling and verification in partially observed Petri nets ⋮ Unnamed Item ⋮ On the fluidization of Petri nets and marking homothecy ⋮ Structure and behavior preservation by Petri-net-based refinements in system design ⋮ A note on regular Petri nets ⋮ Steady-state performance evaluation of continuous mono-T-semiflow Petri nets ⋮ Observability of continuous Petri nets with infinite server semantics ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Structural Analysis for Stochastic Process Algebra Models ⋮ Analyzing Reachability for Some Petri Nets With Fast Growing Markings ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ Fluid computation of passage-time distributions in large Markov models ⋮ Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph ⋮ On the combination of polyhedral abstraction and SMT-based model checking for Petri nets