Abstract
We study functions preserving properties of transition systems described by formulas of a logic.
Let L be a logic for which transition systems constitute a class of models. A formula F of L defines for a given transition system S and interpretation i, a property ; a state q of S satisfies the property represented by F iff
. Given two transition systems S1 and S2 with sets of states respectively Q1 and Q2 and a function f, f : 2Q 1→2Q 2, we say that f preserves the property represented by F iff
The results presented concern the characterization of functions f which preserve properties independently of the particular choice of S1 and S2 provided that the transition systems be related via homomorphisms of a certain type.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. BEN-ARI, Z. MANNA and A. PNUELI "The temporal logic of branching time" 8th Annual ACM Symp. on Principles of Programming Languages, January 1981, pp164–176.
G. BERTHELOT "Vérification des réseaux de Petri" Thèse 3ème cycle, Université Paris VI, Paris, January 1978.
D. BRAND "Algebraic simulation between parallel programs" IBM research Report RC 7206 (/=/ 30923) 6/29/78, IBM Yorktown Heights.
S.D. BROOKES and W.C. ROUNDS "Behavioural equivalence relations induced by programming logics" to appear in Proc. ICALP83, Barcelona, Spain.
A.GINSBURG "Algebraic theory of automata" Academic Press, New York and London, 1968.
J.S. GOURLAY, W.C. ROUNDS and R. STATMAN "On properties preserved by contractions of concurrent systems" Proc. Int. Symp. Semantics of Concurrent Computation, LNCS Vol.70, pp51–65, 1979.
K. JENSEN "A method to compare the descriptive power of different types of Petri nets" Proc. MFCS80, LNCS Vol.88, pp348–361.
M. HENNESSY and R. MILNER "On observing non determinism and concurrency" Proc. ICALP80, LNCS Vol. 85, 1980, pp299–309.
T. KASAI and R.E. MILNER "Homomorphisms between models of parallel computation" IBM Research Report RC7796 (/=/ 33742) 8/2/79, Yorktown Heights.
Y.S. KWONG "On reductions of asynchronous systems" Theor. Comp. Sci. 5, pp25–30, 1977.
R.J. LIPTON "Reduction: a method of proving properties of parallel programs" CACM Vol. 18, No 12, Dec. 1975, pp717–721.
A.I. MAL'CEV "Algebraic systems" Springer Verlag, Berlin Heidelberg New York, 1973.
R. MILNER "An algebraic definition of simulation between programs" Proc. Second Int. joint Conf. on Artificial Intelligence BCS, pp481–489, Sept. 1981.
R. MILNER "A calculus of communicating systems" LNCS Vol.92, 1980.
R. MILNER "Calculi for synchrony and asynchrony" Report TR CSR 104–82, Univ. of Edinburgh, Dept. of Computer Sci. 1982.
J.P. QUEILLE and J. SIFAKIS "Specification and verification of concurrent systems in CESAR" LNCS Vol. 137, pp337–351, April 82.
G. ROUCAIROL and R. VALK "Reductions of nets and parallel programs" Net theory and applications, LNCS Vol.84, 1979.
J. SIFAKIS "Property preserving homomorphisms and a notion of simulation for transition systems" Report RR332, IMAG, Grenoble, Nov. 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sifakis, J. (1984). Property preserving homomorphisms of transition systems. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_381
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_381
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive