Tiles, Rewriting Rules and CCS
Open Access
- 1 January 1996
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 4, 1-19
- https://doi.org/10.1016/s1571-0661(04)00030-1
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- An abstract formulation for rewrite systemsPublished by Springer Nature ,2005
- Compositionality through an operational semantics of contextsPublished by Springer Nature ,2005
- Tiles, Rewriting Rules and CCSElectronic Notes in Theoretical Computer Science, 1996
- Semantics of weakening and contractionAnnals of Pure and Applied Logic, 1994
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Formal verification of parallel programsCommunications of the ACM, 1976
- Review of the elements of 2-categoriesPublished by Springer Nature ,1974