The following pages link to Javier Esparza (Q264200):
Displaying 50 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Verification of population protocols (Q523133) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Trapping mutual exclusion in the box calculus (Q672869) (← links)
- Reachability in cyclic extended free-choice systems (Q685410) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- Zeros of the Hankel function of real order out of the principal Riemann sheet (Q1184780) (← links)
- Traps characterize home states in free choice systems (Q1194324) (← links)
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
- Reduction and synthesis of live and bounded free choice Petri nets (Q1336048) (← links)
- Model checking using net unfoldings (Q1346682) (← links)
- An improvement of McMillan's unfolding algorithm (Q1600655) (← links)
- Polynomial analysis algorithms for free choice probabilistic workflow nets (Q1693120) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Shortest paths in reachability graphs (Q1900935) (← links)
- Decidability of model checking for infinite-state concurrent systems (Q1920224) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- Checking qualitative liveness properties of replicated systems with stochastic scheduling (Q2226750) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Verification (Q2244833) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Computing the concurrency threshold of sound free-choice workflow nets (Q2324223) (← links)
- From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)
- Unfoldings: A partial-order approach to model checking. (Q2426635) (← links)
- Population protocols: beyond runtime analysis (Q2695486) (← links)
- (Q2729233) (← links)
- (Q2754086) (← links)
- (Q2754166) (← links)
- (Q2775861) (← links)
- (Q2851071) (← links)
- On the memory consumption of probabilistic pushdown automata (Q2920112) (← links)
- An SMT-Based Approach to Coverability Analysis (Q2920990) (← links)
- Message-Passing Algorithms for the Verification of Distributed Protocols (Q2938068) (← links)
- Negotiation Programs (Q2941149) (← links)
- A generic approach to the static analysis of concurrent programs with procedures (Q2942913) (← links)
- (Q2963916) (← links)
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). (Q2965467) (← links)
- A Perfect Model for Bounded Verification (Q2986805) (← links)
- Newtonian program analysis (Q2999782) (← links)
