A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Computation and automata
Transition systems, infinitary languages and the semantics of uniform concurrency
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Formal languages
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Global renaming operators in concrete process algebra
Information and Computation
Readies and failures in the algebra of communicating processes
SIAM Journal on Computing
Communication and concurrency
Process algebra
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
Undecidable equivalences for basic process algebra
Information and Computation
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Linear Time and Branching Time Semantics for Recursion with Merge
Proceedings of the 10th Colloquium on Automata, Languages and Programming
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for all Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Analysis of communicating finite-state processes
Analysis of communicating finite-state processes
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Basic process algebra with deadlocking states
Theoretical Computer Science
Register-machine based processes
Journal of the ACM (JACM)
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Modeling dynamic objects in distributed systems with nested Petri nets
Fundamenta Informaticae
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
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
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
A note on an expressiveness hierarchy for multi-exit iteration
Information Processing Letters
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Bisimulation and language equivalence
Logic for concurrency and synchronisation
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
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
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Regular Strategies as Proof Tactics for CIRC
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Composition of Motion Description Languages
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Decidable first-order transition logics for PA-processes
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
Deciding weak bisimilarity of normed context-free processes using tableau
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
More on weak bisimilarity of normed basic parallel processes
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Information and Computation
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Some remarks on definability of process graphs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
| Hi-index | 0.01 |