ESTL: A temporal logic for events and states?

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

Abstract

In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods. In this paper we introduce a temporal logic for Petri nets which allows to argue about states as well as to argue about events. This way, specifications in the early phases can be event-based and verification in later phases can be state-based within a single formalism.

Cite

CITATION STYLE

APA

Kindler, E., & Vesper, T. (1998). ESTL: A temporal logic for events and states? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1420, pp. 365–384). Springer Verlag. https://doi.org/10.1007/3-540-69108-1_20

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