Skip to main content
Conference ProceedingsOPEN ACCESS

The concurrency workbench with priorities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 575 LNCS 147-157
DOI: 10.1007/3-540-55179-4_15
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents an extension of Milner’s CCS with a priority choice operator accompanied by a suitable notion of bisimulation and a characterizing modal logic. It is implemented in an extension of the analysis tool the Edinburgh-Sussex Concurrency Workbench.

Cite

CITATION STYLE

APA

Jensen, C. T. (1992). The concurrency workbench with priorities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 147–157). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free