Abstract
PROLOG Interpreted Predicate Net (PIPN) is a software tool for the specification and analysis of communications in distributed computing systems. Labelled Predicate/Transition Nets are embedded into a logic programming environment. Executable specifications are defined by labelled transition systems. Observational equivalence and temporal logic techniques are concurrently applied.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, Theory of Communicating Sequential Processes. J. of ACM, 31(3),560–599, 1986.
E. M. Clarke, E. A. Emerson, A. P. Sistla, Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach C. S. dept., Carnegie-Mellon University, Sept. 1983
R. De Nicola Extensional Equivalences of Transition Systems Acta Informatica 24 (1987), pp.211–237.
P. Azéma, J. Ch Lloret, G. Papapanagiotakis, F. Vernadat ESTELLE Validation and Prolog Interpreted Petri Nets in The Formal Description Technique ESTELLE, North-Holland, 1989, Ed. M.Diaz & al, pp.273–302.
H.J. Genrich Net Theory and Application IFIP 86, North Holland, pp. 823–831.
M. Hennessy, R.Milner Algebraics Laws for Nondeterminsm and Concurrency Journal of the A.C.M, Vol 32,1985.
R.Milner A Calculus of Communicating Systems Lecture notes in Computer Science, Vol.64, 1980.
A. Pnueli Applications of Temporal Logic to the Specification and the Verification of the reactive systems Lecture notes in Computer science, Vol 224, 1986.
J. Sifakis A Unified Approach for Studying the Properties of Transition Systems Theoretical Computer Science, Vol. 18 (1982), pp.227–258
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azema, P., Vernadat, F., Lloret, JC. (1990). Requirement analysis for communication protocols. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive