The following pages link to (Q4219024):
Displaying 50 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Reachability problems in BioAmbients (Q418830) (← links)
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- simpA: an agent-oriented approach for programming concurrent applications on top of Java (Q608358) (← links)
- Applying regions (Q728281) (← links)
- Boundedness undecidability for synchronized nets (Q845725) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Soundness-preserving reduction rules for reset workflow nets (Q1007883) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Expired data collection in shared dataspaces. (Q1874282) (← links)
- A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets (Q1960543) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Formal verification of complex business processes based on high-level Petri nets (Q2292988) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Operational semantics for Petri net components (Q2373704) (← links)
- Recursive Petri nets (Q2464034) (← links)
- On the \(\omega\)-language expressive power of extended Petri nets (Q2491637) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- (Q2842877) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Discrete Parameters in Petri Nets (Q2941148) (← links)
- Petri Nets with Structured Data (Q2941152) (← links)
- Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- (Q3384884) (← links)
- When to Move to Transfer Nets (Q3460877) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- Discovery, Verification and Conformance of Workflows with Cancellation (Q3540385) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- About the decision of reachability for register machines (Q4405553) (← links)
- (Q5009428) (← links)