Partial evaluation and &ohgr;-completeness of algebraic specifications
Theoretical Computer Science
Axiomatising finite concurrent processes
SIAM Journal on Computing
Journal of the ACM (JACM)
Tools for proving inductive equalities, relative completeness, and &ohgr;-completeness
Information and Computation
Process algebra
A new strategy for proving &ohgr;-completeness applied to process algebra
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Unique decomposition of processes
Theoretical Computer Science
Towards action-refinement in process algebras
Information and Computation
Communication and Concurrency
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Importance of the Left Merge Operator in Process Algebras
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
On finite alphabets and infinite bases II: completed and ready simulation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On finite alphabets and infinite bases III: simulation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Unique parallel decomposition in branching and weak bisimulation semantics
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not ω-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an ω-complete specification, which is finite in a setting with finitely many actions.