The following pages link to Free Choice Petri Nets (Q4856177):
Displaying 50 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Balanced multi-perspective checking of process conformance (Q272169) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Checking system boundedness using ordinary differential equations (Q454908) (← links)
- The formalization of decision-free Petri net (Q467809) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- Petri nets for modelling metabolic pathways: a survey (Q609029) (← links)
- Structure and behavior preservation by Petri-net-based refinements in system design (Q703482) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Building reduced Petri net models of discrete manufacturing systems (Q814230) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts (Q901256) (← links)
- Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions (Q964840) (← links)
- Preserving correctness during business process model configuration (Q973035) (← links)
- A note on regular Petri nets (Q975419) (← links)
- Simplified proof of the blocking theorem for free-choice Petri nets (Q988568) (← links)
- On conditions for the liveness of weakly persistent nets (Q989543) (← links)
- Soundness-preserving reduction rules for reset workflow nets (Q1007883) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Traps characterize home states in free choice systems (Q1194324) (← links)
- Reduction and synthesis of live and bounded free choice Petri nets (Q1336048) (← links)
- Petri nets for the design and operation of manufacturing systems (Q1375146) (← links)
- Blocking a transition in a free choice net and what it tells about its throughput. (Q1401959) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets (Q1665580) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- Periodic scheduling of marked graphs using balanced binary words (Q1758156) (← links)
- Property-preserving subnet reductions for designing manufacturing systems with shared resources (Q1770402) (← links)
- Distributed monitoring of concurrent and asynchronous systems (Q1773098) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Fifo nets without order deadlock (Q1819941) (← links)
- On liveness and boundedness of asymmetric choice nets (Q1884933) (← links)
- Extensible structural analysis of Petri net product lines (Q2032833) (← links)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- Efficient algorithms for three reachability problems in safe Petri nets (Q2117182) (← links)
- Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins (Q2119954) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN (Q2177760) (← links)
- Markovian dynamics of concurrent systems (Q2177775) (← links)
- Timed negotiations (Q2200811) (← links)
