Skip to main content
Conference ProceedingsOPEN ACCESS

Non-regular process types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 1334-1343
DOI: 10.1007/3-540-48311-x_189
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Process types specify sequences of acceptable messages. Even if the set of acceptable messages changes dynamically, a type checker can statically ensure that only acceptable messages are sent. As proposed so far, all message sequence sets specified by types can be generated by regular grammars. We propose to increase the expressiveness so that non-regular message sequence sets can be specified. Type equivalence and subtyping take possible type extensions into account. © Springer-Verlag Berlin Heidelberg 1999.

Author supplied keywords

Cite

CITATION STYLE

APA

Puntigam, F. (1999). Non-regular process types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1334–1343). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_189

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