Pages that link to "Item:Q2822648"
From MaRDI portal
The following pages link to Application and Theory of Petri Nets and Concurrency (Q2822648):
Displaying 50 items.
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Petri Net Synthesis for Restricted Classes of Nets (Q2822652) (← links)
- Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (Q2822654) (← links)
- Anti-alignments in Conformance Checking – The Dark Side of Process Models (Q2822655) (← links)
- Probabilistic Time Petri Nets (Q2822657) (← links)
- Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models (Q2822659) (← links)
- Decidable Classes of Unbounded Petri Nets with Time and Urgency (Q2822660) (← links)
- Structural Place Invariants for Analyzing the Behavioral Properties of Nested Petri Nets (Q2822661) (← links)
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets (Q2941140) (← links)
- Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs (Q2941141) (← links)
- Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers (Q2941142) (← links)
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs (Q2941144) (← links)
- An SRN-Based Resiliency Quantification Approach (Q2941145) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- Discrete Parameters in Petri Nets (Q2941148) (← links)
- Negotiation Programs (Q2941149) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- Charlie – An Extensible Petri Net Analysis Tool (Q2941151) (← links)
- Petri Nets with Structured Data (Q2941152) (← links)
- On the Reversibility of Live Equal-Conflict Petri Nets (Q2941153) (← links)
- SNAKES: A Flexible High-Level Petri Nets Library (Tool Paper) (Q2941154) (← links)
- Characterizing Stable Inequalities of Petri Nets (Q2941156) (← links)
- Process Discovery Using Localized Events (Q2941158) (← links)
- New Search Strategies for the Petri Net CEGAR Approach (Q2941159) (← links)
- Workflow Management Principles for Interactions Between Petri Net-Based Agents (Q2941160) (← links)
- Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account (Q5100747) (← links)
- Data Centric Workflows for Crowdsourcing (Q5100748) (← links)
- Synthesis for Multi-weighted Games with Branching-Time Winning Conditions (Q5100749) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)
- On-the-Fly Synthesis for Strictly Alternating Games (Q5100753) (← links)
- Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
- A Study on Team Bisimulations for BPP Nets (Q5100755) (← 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)
- Structural Reductions Revisited (Q5100759) (← links)
- Dynamic Recursive Petri Nets (Q5100760) (← links)
- A CTL* Model Checker for Petri Nets (Q5100762) (← links)
- Propagation Nets (Q5166752) (← links)
- Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking (Q5166754) (← links)
- Complex Networks and Link Streams for the Empirical Analysis of Large Software (Q5166755) (← links)
- Soundness of Timed-Arc Workflow Nets (Q5166756) (← links)
- Process Model Discovery: A Method Based on Transition System Decomposition (Q5166757) (← links)
- Discovering Block-Structured Process Models from Incomplete Event Logs (Q5166758) (← links)
- Synthesis of Persistent Systems (Q5166759) (← links)
- Learning Transparent Data Automata (Q5166760) (← links)
- A Programming Language for Spatial Distribution of Net Systems (Q5166761) (← links)
