The following pages link to Marked directed graphs (Q2552879):
Displaying 50 items.
- Explicit routing schemes for implementation of cellular automata on processor arrays (Q272775) (← links)
- Distinguishing between evidence and its explanations in the steering of atomic clocks (Q309343) (← links)
- Modular discrete time approximations of distributed hybrid automata (Q418807) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- Step coverability algorithms for communicating systems (Q433351) (← links)
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Reachability in cyclic extended free-choice systems (Q685410) (← links)
- A theory of bipolar synchronization scheme (Q799113) (← links)
- Some behavioural aspects of net theory (Q913516) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- Normal Petri nets (Q1057065) (← links)
- Reducibility of synchronization structures (Q1085606) (← links)
- Relevance of network theory to models of distributed/parallel processing (Q1138905) (← links)
- A characterization of systems derived from terminating concurrent histories (Q1143805) (← links)
- Regularity and firing sequences of computation graphs (Q1159465) (← links)
- Data flow analysis of program nets (Q1163368) (← links)
- Traps characterize home states in free choice systems (Q1194324) (← links)
- Compositional generation of home states in free choice nets (Q1205188) (← links)
- A transformation of marked graphs (Q1212014) (← links)
- A decidability theorem for a class of vector-addition systems (Q1216050) (← links)
- A note on transition systems (Q1230656) (← links)
- (A-)synchronous (non)-deterministic cell spaces simulating each other (Q1253921) (← links)
- Analysis of Petri nets by stepwise refinements (Q1255320) (← links)
- Analysis and identification of speed-independent circuits on an event model (Q1314511) (← links)
- Upper and lower bounds for stochastic marked graphs (Q1321817) (← links)
- Tentative and definite distributed computations: An optimistic approach to network synchronization (Q1330420) (← links)
- Using timed Petri net to model instruction-level loop scheduling with resource constraints (Q1331226) (← links)
- The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
- Petri nets for the design and operation of manufacturing systems (Q1375146) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Periodic scheduling of marked graphs using balanced binary words (Q1758156) (← links)
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets (Q1776410) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Asymptotic properties of stochastic timed event graphs (Q1916034) (← links)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- A survey of siphons in Petri nets (Q2279728) (← links)
- An extension of the taxonomy of persistent and nonviolent steps (Q2293146) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- State space axioms for T-systems (Q2340253) (← links)
- Implementing dataflow with threads (Q2377253) (← links)
- Marked directed graphs (Q2552879) (← links)
- Marking optimization of stochastic timed event graphs using IPA (Q2563778) (← links)
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues (Q2639765) (← links)
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems (Q2641226) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
