scientific article; zbMATH DE number 1302047
From MaRDI portal
Publication:4247290
zbMath0926.68087MaRDI QIDQ4247290
Publication date: 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (66)
Compact and efficiently verifiable models for concurrent systems ⋮ On the Termination of Integer Loops ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ Stubborn versus structural reductions for Petri nets ⋮ The Complexity of Reversal-Bounded Model-Checking ⋮ Computation in networks of passively mobile finite-state sensors ⋮ Parameterized model checking of rendezvous systems ⋮ On reducing linearizability to state reachability ⋮ Language Representability of Finite P/T Nets ⋮ Merged processes: a new condensed representation of Petri net behaviour ⋮ Waiting nets ⋮ On selective unboundedness of VASS ⋮ Unnamed Item ⋮ Universality in Infinite Petri Nets ⋮ Computing the reveals relation in occurrence nets ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Undecidability of accordance for open systems with unbounded message queues ⋮ The reachability problem for branching vector addition systems requires doubly-exponential space ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Parameterized Analysis of Immediate Observation Petri Nets ⋮ Unnamed Item ⋮ Waiting Nets: State Classes and Taxonomy ⋮ Timed negotiations ⋮ Unnamed Item ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Deciding Structural Liveness of Petri Nets ⋮ On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Catalytic and communicating Petri nets are Turing complete ⋮ Negotiation as concurrency primitive ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Partial order reduction for reachability games ⋮ 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 ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Inheritance of behavior ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ Unnamed Item ⋮ On the complexity of resource-bounded logics ⋮ The complexity of verifying population protocols ⋮ Reduction techniques for network validation in systems biology ⋮ A Rice-style theorem for parallel automata ⋮ Regular Expressions with Counting: Weak versus Strong Determinism ⋮ Parameterized Complexity Results for 1-safe Petri Nets ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ Analyzing Reachability for Some Petri Nets With Fast Growing Markings ⋮ A Practical Approach to Verification of Mobile Systems Using Net Unfoldings ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable ⋮ Energy Games in Multiweighted Automata ⋮ Structural soundness of workflow nets is decidable ⋮ Unnamed Item ⋮ A valuation-based analysis of conflict-free Petri nets ⋮ 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 ⋮ The complexity of achievement and maintenance problems in agent-based systems ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves ⋮ Computing parameterized invariants of parameterized Petri nets
This page was built for publication: