Nordic Journal of Computing
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
An Axiomatic Semantics for the Synchronous Language Gentzen
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
An axiomatic semantics for the synchronous language Gentzen
Journal of Computer and System Sciences
Nested semantics over finite trees are equationally hard
Information and Computation
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
On the axiomatisability of priority
Mathematical Structures in Computer Science
A framework for performance evaluation and functional verification in stochastic process algebras
Proceedings of the 2008 ACM symposium on Applied computing
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Basic Parallel Process as a Parallel Pushdown Automaton
Electronic Notes in Theoretical Computer Science (ENTCS)
Process Algebra: An Algebraic Theory of Concurrency
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Impossibility results for the equational theory of timed CCS
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On the axiomatizability of priority
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
Rule formats for distributivity
Theoretical Computer Science
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 |