Decidable Subsets of CCS (original) (raw)
Related papers
Bisimulation Equivalence Is Decidable for All Context-Free Processes
Information and Computation, 1995
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM, 1993
Decidability, behavioural equivalences and infinite transition graphs
1991
Silence is golden: Branching bisimilarity is decidable for context-free processes
Lecture Notes in Computer Science, 1992
Observations on the Decidability of Transitions
Lecture Notes in Computer Science, 2004
On the decidability of process equivalences for the π-calculus
Theoretical Computer Science, 1997
Undecidable equivalences for basic parallel processes
Information and Computation, 2009
On the Expressiveness of CCS with Replication
2007
Refining the Undecidability Border of Weak Bisimilarity
Jan Strejček, Mojmír Křetínský
Electronic Notes in Theoretical Computer Science, 2006
Bisimulation equivalence is decidable for basic parallel processes
Lecture Notes in Computer Science, 1993
State-oriented Noninterference for CCS
Electronic Notes in Theoretical Computer Science, 2007
A non-standard semantics for generating reduced transition systems
Nicoletta Francesco, Antonella Santone, gigliola vaglini
Lecture Notes in Computer Science, 1997
On Process Equivalence = Equation Solving in CCS
Journal of Automated Reasoning, 2009
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic, 2008
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
Lecture Notes in Computer Science, 2004
On the Expressiveness and Decidability of Higher-Order Process Calculi
2008
Techniques for Decidability and Undecidability of Bisimilarity
Lecture Notes in Computer Science, 1999
Split-2 Bisimilarity has a Finite Axiomatization over CCS with
Hennessy's Merge
Logical Methods in Computer Science, 2005
On the Expressiveness of CCS-like Calculi
2004
Journal of Logic, Language and Information, 1994
L(A) = L(B)? Decidability Results from Complete Formal Systems
Springer eBooks, 2002
A Note on Scope and Infinite Behaviour in CCS-like Calculi
2007
Complete formal systems for equivalence problems
Theoretical Computer Science, 2000
Uniform approaches to the verification of finite state systems
State University of New York at Albany, Albany, NY, 1997
Decidability of bisimulation equivalences for parallel timer processes
Lecture Notes in Computer Science, 1993
Refining Undecidability Border of Weak Bisimilarity. (fullversion of INFINITY 2005 paper)
2005
Decidability Results from Complete Formal Systems
Theoretical Computer Science, 2001
A new decidable problem, with applications
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977
A perfect model for bounded verification
2012
A short proof of the decidability of bisimulation for normed bpa-processes
Information Processing Letters, 1992
Chapter 2 Languages , Decidability , and Complexity
2012
Deciding Bisimulation-Like Equivalences with Finite-State Processes
1999
An algebraic characterization of transition system equivalences
Information and Computation, 1989
Verifying Identical Communicating Processes is Undecidable
Theoretical Computer Science, 1997
A Process-Theoretic Look at Automata
Lecture Notes in Computer Science, 2010