scientific article; zbMATH DE number 1302047

Cited in

(81)

A Rice-style theorem for parallel automata
Structural soundness of workflow nets is decidable
A valuation-based analysis of conflict-free Petri nets
Compact and efficiently verifiable models for concurrent systems
Stubborn versus structural reductions for Petri nets
Parameterized model checking of rendezvous systems
Reduction techniques for network validation in systems biology
The complexity of verifying population protocols
Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
Computing parameterized invariants of parameterized Petri nets
Waiting nets
Timed negotiations
Team bisimilarity, and its associated modal logic, for BPP nets
Finding cut-offs in leaderless rendez-vous protocols is easy
Directed reachability for infinite-state systems
Computable fixpoints in well-structured symbolic model checking
Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
Computation in networks of passively mobile finite-state sensors
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
A parametric analysis of the state-explosion problem in model checking
Complexity results for problems of communication-free Petri nets and related formalisms
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
On the termination of integer loops
Deciding Selective Declassification of Petri Nets
Forward analysis and model checking for trace bounded WSTS
Universality in infinite Petri nets
Deciding Structural Liveness of Petri Nets
An algorithm for direct construction of complete merged processes
Parameterized Complexity Results for 1-safe Petri Nets
Energy games in multiweighted automata
The complexity of reversal-bounded model-checking
Deciding fast termination for probabilistic VASS with nondeterminism
Language representability of finite P/T nets
Entscheidbarkeit bei Petri Netzen
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
On selective unboundedness of VASS
A hierarchical decomposition of decision process Petri nets for modeling complex systems
Computing the reveals relation in occurrence nets
Undecidability of accordance for open systems with unbounded message queues
The reachability problem for branching vector addition systems requires doubly-exponential space
scientific article; zbMATH DE number 4115984 (Why is no real title available?)
Catalytic and communicating Petri nets are Turing complete
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Polynomial vector addition systems with states
Regular separability of well-structured transition systems
Soundness verification of data-aware process models with variable-to-variable conditions
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
Computing Parameterized Invariants of Parameterized Petri Nets
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
scientific article; zbMATH DE number 7559504 (Why is no real title available?)
On the high complexity of Petri nets -languages
Interleaving vs True Concurrency: Some Instructive Security Examples
PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
The virtues of idleness: a decidable fragment of resource agent logic
Affine extensions of integer vector addition systems with states
Soundness of workflow nets: classification, decidability, and analysis
Stubborn set reduction for two-player reachability games
Partial order reduction for reachability games
Long-Run Average Behavior of Vector Addition Systems with States
Regular Expressions with Counting: Weak versus Strong Determinism
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
On the complexity of resource-bounded logics
Inheritance of behavior
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Parameterized Analysis of Immediate Observation Petri Nets
Waiting Nets: State Classes and Taxonomy
Automated polyhedral abstraction proving
Parameterized verification under TSO with data types
Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
Reasoning about reversal-bounded counter machines
On the complexity of proving polyhedral reductions
The complexity of bounded context switching with dynamic thread creation
Causally deterministic Markov decision processes
Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
Safety analysis of parameterised networks with non-blocking rendez-vous
Improved lower bounds for reachability in vector addition systems
Knowing-how reasoning with budgets recasted: universal reachability problem on VASS
The residue of vector sets with applications to decidability problems in Petri nets
The complexity of achievement and maintenance problems in agent-based systems
Merged processes: a new condensed representation of Petri net behaviour
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247290)