AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra
We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significa...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractIn this paper the methodology of some theories of concurrency (mainly CCS and CSP) is analys...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
The (in)equational properties of the least fixed point operation on(omega-)continuous functions on (...
While different algebraic structures have been proposed for the treatment of concurrency, finding so...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractThis paper presents a rather concrete view of a semantic universe for typed concurrent compu...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
A connection is established between the semantic theories of concurrency and communication in the wo...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significa...
AbstractProcess algebra has been successful in many ways; but we don't yet see the lineaments of a f...
We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significa...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractIn this paper the methodology of some theories of concurrency (mainly CCS and CSP) is analys...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
The (in)equational properties of the least fixed point operation on(omega-)continuous functions on (...
While different algebraic structures have been proposed for the treatment of concurrency, finding so...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
AbstractA simple domain theory for concurrency is presented. Based on a categorical model of linear ...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractThis paper presents a rather concrete view of a semantic universe for typed concurrent compu...
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic an...
A connection is established between the semantic theories of concurrency and communication in the wo...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significa...
AbstractProcess algebra has been successful in many ways; but we don't yet see the lineaments of a f...
We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significa...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractIn this paper the methodology of some theories of concurrency (mainly CCS and CSP) is analys...
DOI
Add to ORKG