The linear time-branching time spectrum

349Citations
Citations of this article
81Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper eleven semantics in the linear time - branching time spectrum are presented in a uniform, modelindependenl way. Restricted to the domain of finitely branching, concrete, sequential processes, most semantics found in the literature that can be defined uniformly in terms of action relations coincide with one of these eleven. Several testing scenarios, motivating these semantics, are presented, phrased in terms of 'button pushing experiments' on generative and reactive machines. Finally nine of these semantics are applied to a simple language for finite, concrete, sequential, nondeterministic processes, and for each of them a complete axiomatization is provided.

Cite

CITATION STYLE

APA

van Glabbeek, R. J. (1990). The linear time-branching time spectrum. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 458 LNCS, pp. 278–297). Springer Verlag. https://doi.org/10.1007/BFb0039066

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