Skip to main content
Conference ProceedingsOPEN ACCESS

A linear time process Algebra

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

This article is free to access.

Abstract

This paper presents a variant of Milner’s Calculus for Communicating Systems enriched with a notion of time. Time here is considered to be a totally ordered monoid rather than a particular numerical domain. A set of laws for the algebra are presented, as well as a transition system semantics. The laws are then shown to be consistent and complete.

Cite

CITATION STYLE

APA

Jeffrey, A. (1992). A linear time process Algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 433–442). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_40

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