The regular viewpoint on PA-processes
Theoretical Computer Science
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Formal and natural computing
Decidable first-order transition logics for PA-processes
Information and Computation
A Diophantine model of routes in structured P2P overlays
ACM SIGMETRICS Performance Evaluation Review
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Decidable first-order transition logics for PA-processes
Information and Computation
Modeling Proteolysis from Mass Spectrometry Proteomic Data
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Complexity of pattern-based verification for multithreaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Decidability of branching bisimulation on normed commutative context-free processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Model checking EGF on basic parallel processes
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Behavioural contracts with request-response operations
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Parikh's theorem and descriptional complexity
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Concurrent games on VASS with inhibition
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |