The following pages link to (Q4247290):
Displayed 50 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Computing the reveals relation in occurrence nets (Q391112) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Structural soundness of workflow nets is decidable (Q1044705) (← links)
- A valuation-based analysis of conflict-free Petri nets (Q1605406) (← links)
- Compact and efficiently verifiable models for concurrent systems (Q1620959) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- On reducing linearizability to state reachability (Q1641012) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- Reduction techniques for network validation in systems biology (Q1790877) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- Waiting nets (Q2165233) (← links)
- Timed negotiations (Q2200811) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Universality in Infinite Petri Nets (Q2945886) (← links)
- Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Energy Games in Multiweighted Automata (Q3105747) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- (Q5002821) (← links)
- (Q5009453) (← links)
- Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions (Q5025032) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Computing Parameterized Invariants of Parameterized Petri Nets (Q5044400) (← links)