Reset nets between decidability and undecidability
From MaRDI portal
Recommendations
- Boundedness of reset P/T nets
- Synthesis of (choice-free) reset nets
- From decidability to undecidability by considering regular sets of instances
- Frontier between decidability and undecidability: A survey
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
- Decidability and undecidability in the enumerable Turing degrees
- Decidability problems of a basic class of object nets
- Decidability and undecidability in cellular automata
- Decidability of the Petri net reachability problem
- scientific article; zbMATH DE number 3943004
Cited in
(75)- Soundness-preserving reduction rules for reset workflow nets
- Undecidable problems in unreliable computations.
- Handling infinitely branching well-structured transition systems
- A well-structured framework for analysing Petri net extensions
- Tree automata with one memory set constraints and cryptographic protocols
- Parameterized verification of monotone information systems
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Expired data collection in shared dataspaces.
- A polynomial -bisimilar normalization for reset Petri nets
- Process calculi as a tool for studying coordination, contracts and session types
- Parameterized verification of coverability in infinite state broadcast networks
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Synthesis of (choice-free) reset nets
- Branch-well-structured transition systems and extensions
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Directed reachability for infinite-state systems
- Computable fixpoints in well-structured symbolic model checking
- Formal verification of complex business processes based on high-level Petri nets
- Looking at mean-payoff and total-payoff through windows
- Operational semantics for Petri net components
- Recursive Petri nets
- On the \(\omega\)-language expressive power of extended Petri nets
- Petri nets with name creation for transient secure association
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Context-free commutative grammars with integer counters and resets
- Recent advances on reachability problems for valence systems (invited talk)
- Monotonic extensions of Petri nets: forward and backward search revisited
- Ideal abstractions for well-structured transition systems
- Forward analysis and model checking for trace bounded WSTS
- Discrete parameters in Petri nets
- Petri nets with structured data
- Decidability problems in Petri nets with names and replication
- Synthesis of Petri nets with whole-place operations and localities
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- Parameterized verification of coverability in well-structured broadcast networks
- When to move to transfer nets. On the limits of Petri nets as models for process calculi
- Tree Pattern Rewriting Systems
- Discovery, Verification and Conformance of Workflows with Cancellation
- On selective unboundedness of VASS
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
- Reachability problems in BioAmbients
- About the decision of reachability for register machines
- Catalytic and communicating Petri nets are Turing complete
- Boundedness of reset P/T nets
- Affine extensions of integer vector addition systems with states
- Regular separability of well-structured transition systems
- Coverability, termination, and finiteness in recursive Petri nets
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- Reachability for two-counter machines with one test and one reset
- Dynamic Recursive Petri Nets
- On Petri nets with hierarchical special arcs
- Forward analysis for WSTS. III: Karp-Miller trees
- Soundness of workflow nets: classification, decidability, and analysis
- On the Dynamics of PB Systems with Volatile Membranes
- A classification of the expressive power of well-structured transition systems
- Decidability and complexity of Petri nets with unordered data
- Expressive Power of Broadcast Consensus Protocols
- Well-structured transition systems everywhere!
- simpA: an agent-oriented approach for programming concurrent applications on top of Java
- What else is undecidable about loops?
- Decidability of Resilience for Well-Structured Graph Transformation Systems
- Branch-well-structured transition systems and extensions
- On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
- Acyclic Petri and workflow nets with resets
- About decisiveness of dynamic probabilistic models
- Monus semantics in vector addition systems with states
- Separability and non-determinizability of WSTS
- Soundness of reset workflow nets
- Verifying unboundedness via amalgamation
- On strongest algebraic program invariants
- Applying regions
- Safety and reachability in k-control games on integer vector addition systems with states
- Boundedness undecidability for synchronized nets
- Reduction rules for reset/inhibitor nets
This page was built for publication: Reset nets between decidability and undecidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4219024)
