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