- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
- Automatic Verification of Multiqueue Discrete Timed Automata
- Under consideration for publication in Formal Aspects of Computing Information Gain of Black-box Testing1
- Automatic Verification of Multi-queue Discrete Timed Automata
- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
- Presburger Liveness Veri cation of Discrete Timed Automata 1
- September 30, 2007 16:10 WSPC/INSTRUCTION FILE stateless-ijfcs ON STATELESS AUTOMATA AND P SYSTEMS
- Catalytic P Systems, Semilinear Sets, and Vector Addition Systems
- Bond Computing Systems: a Biologically Inspired and High-level Dynamics Model for Pervasive Computing
- On Removing the Pushdown Stack in Reachability Constructions ?
- M.L. Lee, K.L. Tan, and V. Wuwongse (Eds.): DASFAA 2006, LNCS 3882, pp. 767 776, 2006. Springer-Verlag Berlin Heidelberg 2006
- On the Emptiness Problem for TwoWay NFA with One ReversalBounded Counter ?
- Linear Reachability Problems and Minimal Solutions to Linear Diophantine Equation Systems
- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
- Past Pushdown Timed Automata and Safety Verification
- On Presburger Liveness of Discrete Timed Automata Zhe Dang 1 , Pierluigi San Pietro 2 and Richard A. Kemmerer 3
- Generalized Discrete Timed Automata: Decidable Approximations for Safety Verification ?
- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
- Counter Machines and Veri cation Problems 1 Oscar H. Ibarra 2 , Jianwen Su 2 , Zhe Dang 3 , Tev k Bultan 4 ,
- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear
- Safety Verification for Two-Way Finite Automata with Monotonic Counters
- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear
- Linear Reachability Problems and Minimal Solutions to Linear Diophantine Equation Systems
- Catalytic P Systems, Semilinear Sets, and Vector Addition Systems 1
- CTL Model-checking for Systems with Unspecified Components
- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
- Automata and Processes on Multisets of Communicating Linmin Yang1
- Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems
- Generalized Discrete Timed Automata: Decidable Approximations for Safety Verification
- Outline Introduction Definition Decidability of Presburger Reachability Multiprocess Service Automata Discussions Automata on Multisets of Communicating
- Journal of Automata, Languages and Combinatorics u (v) w, xy Otto-von-Guericke-Universitat Magdeburg
- The Power of Maximal Parallelism in P Systems Oscar H. Ibarra
- On Two-Way Nondeterministic Finite Automata with One Reversal-Bounded Counter
- Theoretical Computer Science 302 (2003) 93121 www.elsevier.com/locate/tcs
- Eliminating the Storage Tape in Reachability Constructions
- Verification in Loosely Synchronous Queue-Connected Discrete Timed Automata
- Bond Computing Systems: a Biologically Inspired and High-level Dynamics Model for Pervasive Computing
- Signaling P Systems and Verification Problems , Oscar H. Ibarra
- On Model-Checking of P Systems , Oscar H. Ibarra
- Testing Systems of Concurrent Black-boxes--an Automata-Theoretic and Decompositional Approach
- On Sequential and 1-Deterministic P Systems Oscar H. Ibarra
- Testability of Oracle Automata (extended abstract)
- Characterizations of Catalytic Membrane Computing Systems
- On Removing the Pushdown Stack in Reachability Constructions
- Past Pushdown Timed Automata (Extended Abstract)
- Counter Machines: Decidable Properties and Applications to Verification Problems
- A Symbolic Model Checker for Testing ASTRAL Real-time Specifications
- CptS 516 hw3 1. (hard) I have four fish tanks: T1, T2, T3, T4, to hold water only (no fish).
- Reachability Problems for Dense Counter Machines , Oscar H. Ibarra
- Automata on Multisets of Communicating Objects Linmin Yang
- On Stateless Automata and P Systems Linmin Yang1
- On Presburger Liveness of Discrete Timed Automata , Pierluigi San Pietro
- On Two-Way FA with Monotonic Counters and Quadratic Diophantine Equations
- Characterizations of Catalytic Membrane Computing Systems ?
- Verification in Loosely Synchronous QueueConnected Discrete Timed Automata ?
- Safety Verification for TwoWay Finite Automata with Monotonic Counters ?
- Past Pushdown Timed Automata and Safety Verification 1
- Eliminating the Storage Tape in Reachability Constructions 1
- International Journal of Foundations of Computer Science World Scienti c Publishing Company
- Testability of Oracle Automata (extended abstract)
- Past Pushdown Timed Automata (Extended Abstract)
- On TwoWay FA with Monotonic Counters and Quadratic Diophantine Equations
- On Composition and Lookahead Delegation of -Services Modeled by Automata
- Algorithm to find the actual minimum number of comparisons to sort eight numbers It has been shown that log2n! is a theoretical minimum bound to sort n distinct
- CptS 260 Introduction to Computer Architecture HW#1 Homework #1
- CptS 260 Introduction to Computer Architecture HW#2 Homework #2