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