scientific article; zbMATH DE number 1302046
From MaRDI portal
Publication:4247289
Recommendations
Cited in
(48)- Integer linear programming and the analysis of some Petri net problems
- Fluid approximation of Petri net models with relatively small populations
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
- On liveness and boundedness of asymmetric choice nets
- On K-diagnosability of Petri nets via integer linear programming
- Current-state opacity modelling and verification in partially observed Petri nets
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- 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
- On the fluidization of Petri nets and marking homothecy
- Hybrid and hybrid adaptive Petri nets: on the computation of a reachability graph
- A Petri net model for membrane systems with dynamic structure
- Monotonic extensions of Petri nets: forward and backward search revisited
- Charlie -- an extensible Petri net analysis tool
- Structural analysis for stochastic process algebra models
- Individuals, populations and fluid approximations: a Petri net based perspective
- Continuous Petri Nets: Expressive Power and Decidability Issues
- A relation-algebraic approach to liveness of place/transition nets
- scientific article; zbMATH DE number 4031001 (Why is no real title available?)
- Using linear programming in Petri net analysis
- Projection approaches to process mining using region-based techniques
- scientific article; zbMATH DE number 1216193 (Why is no real title available?)
- scientific article; zbMATH DE number 1302045 (Why is no real title available?)
- scientific article; zbMATH DE number 1836396 (Why is no real title available?)
- A Petri net based approach for multi-robot path planning
- On the Use of Linear Combination in PWCP-Nets
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- Linear equations with ordered data
- Automated Technology for Verification and Analysis
- Petri Net Reductions for Counting Markings
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Minimal generating sets for semiflows
- Property directed reachability for generalized Petri nets
- Solvability of orbit-finite systems of linear equations
- Orbit-finite linear programming
- Optimization-based computation of bounded sequences to reach target states in DESs
- Structure and behavior preservation by Petri-net-based refinements in system design
- On fluidization of discrete event models: Observation and control of continuous Petri nets
- Fluid computation of passage-time distributions in large Markov models
- Accelerating the computation of dead and concurrent places using reductions
- Closed-loop live marked graphs under generalized mutual exclusion constraint enforcement
- Mathematical programming approach to the Petri nets reachability problem
- Verification of bounded Petri nets using integer programming
- Tracking control of join-free timed continuous Petri net systems under infinite servers semantics
- A note on regular Petri nets
- Observability of continuous Petri nets with infinite server semantics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247289)
