Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3343634 (Why is no real title available?)
- scientific article; zbMATH DE number 3356176 (Why is no real title available?)
- Marked directed graphs
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Scheduling Parallel Computations
Cited in
(99)- A decomposition theorem for finite persistent transition systems
- A connection between circular colorings and periodic schedules
- Normal Petri nets
- Reducibility of synchronization structures
- Relevance of network theory to models of distributed/parallel processing
- A characterization of systems derived from terminating concurrent histories
- Regularity and firing sequences of computation graphs
- Data flow analysis of program nets
- Traps characterize home states in free choice systems
- Compositional generation of home states in free choice nets
- A transformation of marked graphs
- A decidability theorem for a class of vector-addition systems
- A note on transition systems
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Analysis of Petri nets by stepwise refinements
- Analysis and identification of speed-independent circuits on an event model
- Upper and lower bounds for stochastic marked graphs
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Using timed Petri net to model instruction-level loop scheduling with resource constraints
- The use of a synchronizer yields the maximum computation rate in distributed networks
- Petri nets for the design and operation of manufacturing systems
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Periodic scheduling of marked graphs using balanced binary words
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- Asymptotic properties of stochastic timed event graphs
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Synthesis and reengineering of persistent systems
- A survey of siphons in Petri nets
- An extension of the taxonomy of persistent and nonviolent steps
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- State space axioms for T-systems
- Implementing dataflow with threads
- Marked directed graphs
- Marking optimization of stochastic timed event graphs using IPA
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- Explicit routing schemes for implementation of cellular automata on processor arrays
- The power of prime cycles
- Succinct discrete time approximations of distributed hybrid automata
- Accurate hybridization of nonlinear systems
- Compositional analysis for linear control systems
- On integration of event-based estimation and robust MPC in a feedback loop
- From synchronous programs to symbolic representations of hybrid systems
- A descent algorithm for the optimal control of constrained nonlinear switched dynamical systems
- Timed automata with observers under energy constraints
- Real-time scheduling of mixture-of-experts systems with limited resources
- On a control algorithm for time-varying processor availability
- Timed I/O automata: a complete specification theory for real-time systems
- Receding horizon control for temporal logic specifications
- Synthesis using approximately bisimilar abstractions, state-feedback controllers for safety specifications
- Oscillation analysis of linearly coupled piecewise affine systems
- On infinity norms as Lyapunov functions for piecewise affine systems
- Identifiability of discrete-time linear switched systems
- Rank properties of Poincaré maps for hybrid systems with applications to bipedal walking
- Stealthy deception attacks on water SCADA systems
- Comparison of overapproximation methods for stability analysis of networked control systems
- Distributed Kalman filter algorithms for self-localization of mobile devices
- Convergence results for ant routing algorithms viastochastic approximation
- Monte-Carlo techniques for falsification of temporal properties of non-linear hybrid systems
- Automatic invariant generation for hybrid systems using ideal fixed points
- Safe compositional network sketches: formal framework
- Bayesian statistical model checking with application to Simulink/Stateflow verification
- On the connections between PCTL and dynamic programming
- Modeling and verification of stochastic hybrid systems using HIOA: a case study on DNA replication
- A generating function approach to the stability of discrete-time switched linear systems
- Stabilization of planar switched linear systems using polar coordinates
- Amir Pnueli and the dawn of hybrid systems
- Distinguishing between evidence and its explanations in the steering of atomic clocks
- Modeling for Verification
- A Note on Persistent Petri Nets
- Decomposition Theorems for Bounded Persistent Petri Nets
- scientific article; zbMATH DE number 3612450 (Why is no real title available?)
- Modular discrete time approximations of distributed hybrid automata
- On the capabilities of systolic systems
- Complexity results for weighted timed event graphs
- A comprehensive approach of planning and scheduling based on petri nets
- Some open problems in the design and use of modern production systems
- Step coverability algorithms for communicating systems
- REGULAR STATE MACHINES
- POC net, a subclass of Petri nets, and its application to timed Petri nets
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- Target-oriented Petri net synthesis
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- Characterisation of the state spaces of marked graph Petri nets
- Kleene theorems for product systems
- Conditions for Petri net solvable binary words
- Timed event graph-based cyclic reconfigurable flow shop modelling and optimization
- Structure theory of multi-level deterministically synchronized sequential processes
- Firing rate optimization of cyclic timed event graphs by token allocations
- Notes on liveness and boundedness of extended strong asymmetric choice nets. II
- Linear time analysis of properties of conflict-free and general Petri nets
- Complexity results for 1-safe nets
- Reachability in cyclic extended free-choice systems
- Computations in living organisms modeled by marked graphs
- On the separability problem of VASS reachability languages
- A theory of bipolar synchronization scheme
- Some behavioural aspects of net theory
This page was built for publication: Marked directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2552879)
