Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
Dynamic connectors for concurrency
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]
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Note on the Tableau Technique for Commutative Transition Systems
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th 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
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Formal and natural computing
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
Decidable first-order transition logics for PA-processes
Information and Computation
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Model checking for process rewrite systems and a class of action-based regular properties
Theoretical Computer Science
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
On Symbolic Verification of Weakly Extended PAD
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Note: Petri nets are less expressive than state-extended PA
Theoretical Computer Science
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Deciding Reachability in Mobile Ambients with Name Restriction
Electronic Notes in Theoretical Computer Science (ENTCS)
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
On probabilistic parallel programs with process creation and synchronisation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On decidability of LTL model checking for process rewrite systems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A static analysis using tree automata for XML access control
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Reachability analysis of mobile ambients in fragments of AC term rewriting
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Model checking for process rewrite systems and a class of action-based regular properties
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
An Algebra of Behavioural Types
Information and Computation
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Some remarks on definability of process graphs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Approaches to modeling business processes: a critical analysis of BPMN, workflow patterns and YAWL
Software and Systems Modeling (SoSyM)
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Protocol conformance checking of services with exceptions
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
Checking equality and regularity for normed BPA with silent moves
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Well-Structured pushdown systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 0.01 |