The following pages link to Free Choice Petri Nets (Q4856177):
Displaying 50 items.
- Sensor placement for distinguishability and single structure observer design in continuous timed Petri nets (Q2252990) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- Extremal throughputs in free-choice nets (Q2256881) (← links)
- A survey of siphons in Petri nets (Q2279728) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Observable liveness of Petri nets (Q2340254) (← links)
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures (Q2490114) (← links)
- Probabilistic \(\pi\)-calculus and event structures (Q2870289) (← links)
- On the Reversibility of Live Equal-Conflict Petri Nets (Q2941153) (← links)
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems (Q2944903) (← links)
- Reduction of Workflow Nets for Generalised Soundness Verification (Q2961558) (← links)
- Refinement of Synchronizable Places with Multi-workflow Nets (Q3011886) (← links)
- Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888) (← links)
- On Parametric Steady State Analysis of a Generalized Stochastic Petri Net with a Fork-Join Subnet (Q3011894) (← links)
- Modular Modelling of Software Product Lines with Feature Nets (Q3095246) (← links)
- A Note on Persistent Petri Nets (Q3507378) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- Process Discovery Using Integer Linear Programming (Q3510879) (← links)
- Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems (Q3560559) (← links)
- Decompositional Petri Net Reductions (Q3605479) (← links)
- Grammars Controlled by Special Petri Nets (Q3618592) (← links)
- A fresh look at free choice nets (Q3718162) (← links)
- (Q4023470) (← links)
- REGULAR STATE MACHINES (Q4526933) (← links)
- An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (Q4633174) (← links)
- A formal notation and tool for the engineering of CORBA systems (Q4790903) (← links)
- (Q4807466) (← links)
- Dynamic Slicing Techniques for Petri Nets (Q4982092) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- A Theory of Distributed Markov Chains (Q4988963) (← links)
- Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks (Q5009443) (← links)
- Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions (Q5025056) (← links)
- Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory (Q5025067) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
- A class of composable high level Petri nets (Q5096360) (← links)
- Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account (Q5100747) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)
- Circular Traffic Queues and Petri’s Cycloids (Q5100756) (← links)
- PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
- Automated Repair of Process Models Using Non-local Constraints (Q5100758) (← links)
- Free-choice Nets with Home Clusters are Lucent (Q5158668) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- Negotiations and Petri Nets (Q5268429) (← links)
- Kleene Theorems for Synchronous Products with Matching (Q5268457) (← links)
- (Q5389839) (← links)
- Refining and verifying regular Petri nets (Q5451165) (← links)
- Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée (Q5479839) (← links)
- Introduction to Petri Nets (Q5496928) (← links)
