- Simulation Subsumption in Ramsey-based Buchi Automata Universality and Inclusion Testing
- When Simulation Meets Antichains (on Checking Language Inclusion of NFAs)
- Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi Department of Information Technology,
- Automatic Verification of Directory-based Consistency Protocols
- Monotonic and Downward Closed Games* PAROSH AZIZ ABDULLA, Uppsala University, Sweden.
- Regular Model Checking without Transducers (On Efficient Verification of Parameterized Systems)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Automatic Verification of Dynamic Data-Dependent Programs
- Stochastic Games with Lossy Channels Parosh Aziz Abdulla1
- Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)
- Noname manuscript No. (will be inserted by the editor)
- Monotonic Abstraction in Action (Automatic Verification of Distributed Mutex Algorithms)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place
- Monotonic Abstraction in Parameterized Verification
- Approximated Context-Sensitive Analysis for Parameterized Verification
- Sampled Semantics of Timed Automata Parosh Abdulla, Pavel Krcal, and Wang Yi
- International Journal of Foundations of Computer Science Vol. 20, No. 5 (2009) 779801
- Constrained Monotonic Abstraction: a CEGAR for Parameterized Verification
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Nordic Journal of Computing Using Forward Reachability Analysis for Verification of
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- On the Qualitative Analysis of Conformon P-Systems Parosh Aziz Abdulla1
- Handling Parameterized Systems with Non-Atomic Global Conditions Parosh Aziz Abdulla
- LIPIcs Leibniz International Proceedings in Informatics Mediating for Reduction
- Parameterized Verification of Infinite-state Processes with Global Conditions
- Universality of R-automata with Value Parosh Aziz Abdulla, Pavel Krcal and Wang Yi2
- Comparing the Expressive Power of Well-Structured Transition Systems
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- Verification of Probabilistic Systems with Faulty Communication #
- Undecidability of LTL for Timed Petri Nets Parosh Aziz Abdulla Aletta Nyl'en
- Monotonic and Downward Closed Parosh Aziz Abdulla
- Algorithmic Analysis of Programs with Well QuasiOrdered Domains \Lambda
- Limiting Behavior of Markov Chains with Eager Attractors Parosh Aziz Abdulla
- Verification of Parameterized Timed Systems Parosh Aziz Abdulla
- MultiClock Timed Networks (Extended Abstract)
- Regular Model Checking made Simple and Parosh Aziz Abdulla 1 , Bengt Jonsson 1 , Marcus Nilsson 1 , and Julien d'Orso 1
- Verifying Programs with Unreliable (Extended Abstract)
- Deciding Monotonic Games Parosh Aziz Abdulla 1 , Ahmed Bouajjani 2 , and Julien d'Orso 1
- Designing Safe, Reliable Systems using Scade Parosh Aziz Abdulla 1 , Johann Deneux 1 , Gunnar Stalmarck 2 , Herman Agren 2 ,
- Networks of Identical MultiClock Timed Processes 1
- Reasoning about probabilistic lossy channel systems Parosh Abdulla
- Simulation-Based Iteration of Tree Transducers Parosh Aziz Abdulla 1 , Axel Legay 2? , Julien d'Orso 3 , and Ahmed Rezine 1
- Using Forward Reachability Analysis for Verification of Timed Petri Nets #
- Symbolic Reachability Analysis based on SAT Solvers
- Simulating Perfect Channels with Probabilistic Lossy Channels 2
- Better Quasi-Ordered Transition Systems Parosh Aziz Abdulla Aletta Nyl en
- Model Checking of Systems with Many Identical Timed Processes
- A Survey of Regular Model Checking Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena
- Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property
- Algorithmic Improvements in Regular Model Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso ??
- General Decidability Theorems for InfiniteState (Extended Abstract)
- Undecidable Verification Problems for Programs with Unreliable
- Proving Liveness by Backwards Reachability Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, and Mayank Saksena
- Model Checking of In nite-State Systems Parosh Aziz Abdulla
- Minimization of NonDeterministic Automata with Large Alphabets #
- Better is Better than Well: On Efficient Verification of
- Regular Tree Model Checking Parosh Aziz Abdulla Bengt Jonsson Pritha Mahata
- Eager Markov Chains Parosh Aziz Abdulla
- Verifying Networks of Timed Processes Parosh Aziz Abdulla Bengt Jonsson
- On Unfolding Unbounded Petri Nets Parosh Aziz Abdulla
- Unfoldings of Unbounded Petri Nets Parosh Aziz Abdulla 1 , S. Purushothaman Iyer 2 , and Aletta Nyl'en 1
- Verifying Programs with Unreliable Parosh Abdulla and Bengt Jonsson
- Verifying Programs with Unreliable Channels Parosh Abdulla and Bengt Jonsson
- On the Existence of Network Invariants for Verifying Parameterized Systems \Lambda
- Verifying Programs with Unreliable Parosh Abdulla and Bengt Jonsson
- Undecidable Verification Problems for Programs with Unreliable Channels
- Algorithmic Improvements in Regular Model Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso ??
- Veri cation of Probabilistic Systems with Faulty Communication
- An Improved Search Strategy for Lossy Channel Systems
- Decidable and Undecidable Problems in Systolic Circuit Verification 1 Parosh Abdulla
- Decidability of Zenoness, Token Liveness and Boundedness for DenseTimed Petri Nets
- Forward Reachability Analysis of Timed Petri Nets Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylen
- Effective Lossy Queue Languages Parosh Aziz Abdulla 1 , Luc Boasson 2 , and Ahmed Bouajjani 2
- Decidability of Simulation and Bisimulation between
- Using Forward Reachability Analysis for Verification of Lossy Channel
- Automatic Verification of a Class of Systolic Circuits
- Decidability of Zenoness, Token Liveness and Boundedness for DenseTimed Petri Nets
- Ensuring Completeness of Symbolic Verification Methods
- Effective Lossy Queue Languages Parosh Aziz Abdulla 1 , Luc Boasson 2 , and Ahmed Bouajjani 2 ?
- Handling Global Conditions in Parametrized System Verification
- International Journal of Foundations of Computer Science # World Scientific Publishing Company
- Using Forward Reachability Analysis for Veri cation of Lossy Channel
- Symbolic Verification of Lossy Channel Systems: Application to
- Using (Timed) Petri Nets for Veri cation Parametrized (Timed) Systems
- Timed Petri Nets and BQOs Parosh Aziz Abdulla and Aletta Nyl en
- DECISIVE MARKOV CHAINS PAROSH ABDULLA, NOOMENE BEN HENDA, AND RICHARD MAYR
- Tree Regular Model Checking: A SimulationBased Approach #
- Report on Data ow Dependencies in Billing Processing Systems
- Reasoning about probabilistic lossy channel Parosh Abdulla 1 , Christel Baier 2 , Purushothaman Iyer 3? , and Bengt Jonsson 1
- Simulation is Decidable for Onecounter Nets (Extended Abstract)
- OntheFly Analysis of Systems with Unbounded, Lossy FIFO Channels
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Regular Model Checking for S1S + LTL Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and
- A General Approach to Partial Order Reductions in Symbolic Verification
- Approximated Context-sensitive Analysis for Parameterized Verification
- Computing Optimal Coverability Costs in Priced Timed Petri Nets
- Fundamenta Informaticae XX (2009) 133 1 Universality Analysis for One-Clock Timed Automata
- Carrying Probabilities to the Infinite World Parosh Aziz Abdulla
- Forcing Monotonicity in Parameterized Verification: From Multisets to Words
- Analyzing the Security in the GSM Radio Network using Attack Jungles
- WELL (AND BETTER) QUASI-ORDERED TRANSITION SYSTEMS PAROSH AZIZ ABDULLA
