A connection is established between the semantic theories of concurrency and communication in the works of de Bakker and Zucker, who develop a denotational semantics of concurrency using metric spaces instead of complete partial orders, and Milner, who develops an algebraic semantics of communication based upon observational equivalence between processes. His rigid synchronization trees (RSTs) are endowed with a simple pseudometric distance induced by Milner's weak equivalence relation and the quotient space is shown to be complete. An isometry between this space and the solution to a domain equation of de Bakker and Zucker is established, presenting their solution in a conceptually simpler framework. Under an additional assumption, the equ...
Category theory has been successfully employed to structure the confusing setup of models and equiva...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractSynchronization trees are a concrete underlying model for much of the work on concurrency. T...
A connection is established between the semantic theories of concurrency and communication in the wo...
http://deepblue.lib.umich.edu/bitstream/2027.42/5157/5/bac2963.0001.001.pdfhttp://deepblue.lib.umich...
We use Scott's idea of information systems to provide a complete partial order semantics for concurr...
We use Scott's idea of information systems to provide a complete partial order semantics for concurr...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
AbstractWe introduce a technique - that we name continuation semantics for concurrency (CSC) - which...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractCategory theory has been successfully employed to structure the confusing set-up of models a...
AbstractCategory theory has been successfully employed to structure the confusing setup of models an...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Category theory has been successfully employed to structure the confusing setup of models and equiva...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractSynchronization trees are a concrete underlying model for much of the work on concurrency. T...
A connection is established between the semantic theories of concurrency and communication in the wo...
http://deepblue.lib.umich.edu/bitstream/2027.42/5157/5/bac2963.0001.001.pdfhttp://deepblue.lib.umich...
We use Scott's idea of information systems to provide a complete partial order semantics for concurr...
We use Scott's idea of information systems to provide a complete partial order semantics for concurr...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
AbstractWe introduce a technique - that we name continuation semantics for concurrency (CSC) - which...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractCategory theory has been successfully employed to structure the confusing set-up of models a...
AbstractCategory theory has been successfully employed to structure the confusing setup of models an...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Category theory has been successfully employed to structure the confusing setup of models and equiva...
AbstractSome basic topics in the theory of concurrency are studied from the point of view of denotat...
AbstractSynchronization trees are a concrete underlying model for much of the work on concurrency. T...