Marked directed graphs
From MaRDI portal
Publication:2552879
DOI10.1016/S0022-0000(71)80013-2zbMath0238.05109MaRDI QIDQ2552879
Shimon Even, F. Commoner, Amir Pnueli, A. W. Holt
Publication date: 1971
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items (97)
Explicit routing schemes for implementation of cellular automata on processor arrays ⋮ Tentative and definite distributed computations: An optimistic approach to network synchronization ⋮ Using timed Petri net to model instruction-level loop scheduling with resource constraints ⋮ REGULAR STATE MACHINES ⋮ Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Reducibility of synchronization structures ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Implementing dataflow with threads ⋮ Modeling for Verification ⋮ Distinguishing between evidence and its explanations in the steering of atomic clocks ⋮ On the capabilities of systolic systems ⋮ 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 ⋮ The use of a synchronizer yields the maximum computation rate in distributed networks ⋮ Asymptotic properties of stochastic timed event graphs ⋮ Petri nets for the design and operation of manufacturing systems ⋮ A comprehensive approach of planning and scheduling based on petri nets ⋮ Some open problems in the design and use of modern production systems ⋮ Unnamed Item ⋮ Unison, canon, and sluggish clocks in networks controlled by a synchronizer ⋮ Relevance of network theory to models of distributed/parallel processing ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ A characterization of systems derived from terminating concurrent histories ⋮ A Note on Persistent Petri Nets ⋮ Modular discrete time approximations of distributed hybrid automata ⋮ Decomposition Theorems for Bounded Persistent Petri Nets ⋮ Complexity results for weighted timed event graphs ⋮ Step coverability algorithms for communicating systems ⋮ Regularity and firing sequences of computation graphs ⋮ Some behavioural aspects of net theory ⋮ Data flow analysis of program nets ⋮ 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 ⋮ Receding horizon control for temporal logic specifications ⋮ Synthesis using approximately bisimilar abstractions ⋮ 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 poincare 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 ⋮ 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 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 ⋮ Complexity results for 1-safe nets ⋮ Traps characterize home states in free choice systems ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Reachability in cyclic extended free-choice systems ⋮ Periodic scheduling of marked graphs using balanced binary words ⋮ Compositional generation of home states in free choice nets ⋮ Synthesis and reengineering of persistent systems ⋮ A transformation of marked graphs ⋮ A decidability theorem for a class of vector-addition systems ⋮ Structure theory of multi-level deterministically synchronized sequential processes ⋮ Steady-state performance evaluation of continuous mono-T-semiflow Petri nets ⋮ A note on transition systems ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization ⋮ A survey of siphons in Petri nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Notes on liveness and boundedness of extended strong asymmetric choice nets. II ⋮ Kleene Theorems for Product Systems ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ POC net, a subclass of Petri nets, and its application to timed Petri nets ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ An extension of the taxonomy of persistent and nonviolent steps ⋮ Analysis of Petri nets by stepwise refinements ⋮ A decomposition theorem for finite persistent transition systems ⋮ The Power of Prime Cycles ⋮ A connection between circular colorings and periodic schedules ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable ⋮ Marked directed graphs ⋮ Target-oriented Petri Net Synthesis ⋮ Marking optimization of stochastic timed event graphs using IPA ⋮ Normal Petri nets ⋮ State space axioms for T-systems ⋮ A theory of bipolar synchronization scheme ⋮ Analysis and identification of speed-independent circuits on an event model ⋮ Conditions for Petri Net Solvable Binary Words ⋮ Upper and lower bounds for stochastic marked graphs ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
Cites Work
This page was built for publication: Marked directed graphs
