Abstract
SENS (Synchronised Elementary Net Systems) are derived from low level Petri nets “Condition/events systems” by adding temporal notions. They are used to describe and analyse real-time systems as a set of cooperating sub-systems. Each sub-system, also called a region, has its own logical clock used to specify temporal constraints in the region. Due to these characteristics, SENS can easily be implemented as synchronous programs written with the ESTEREL language.
We present in this paper an approach for building the reachability graph of SENS. Each node of this graph is a set of states equivalent from a logical and temporal points of view and arcs represent occurrences of atomic actions (events) inside an specific interval of time. The reachability graph can be used not only for checking logical properties like deadlocks, liveness, home states but also to predict the minimum and maximum bounds of any sequence of actions, including cyclic sequences.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R.Alur„ N.Halbwachs: “Minimization of timed transition systems”, CONCUR'92, LNCS 630.
R.Alur, D.Dill: “Automata for modelling real-time systems”, ICALP'90, LNCS 443.
R. Alur, D. Dill: “A theory of timed automata”, Theoritical Computer Sciences 126 1994, 183–235.
C.André “Synchronized Elmentary Net Systems”. Advances in Petri Nets 1989, Grzegorz Rozenberg editor, LNCS 424, Springer-Verlag.
G.Berry, G.Gonthier “The synchroneous Programming Language ESTEREL: Design, Semantic, Implementation”. INRIA report 842, 1988.
B. Berthomieu, M. Menasche “An enumerative approach for analyzing time Petri nets”. IFIP Congress 1983, Paris, North-Holland.
B.Berthomieu, M. Diaz “Modeling and verification of time dependent systems using time Petri nets”, IEEE Transactions on Software Engineering vol 17, Nℴ3, March 91.
C.Courcoubetis, M.Yannakakis: “Minimum and Maximum Delay problems in Real-time systems”. CAV'91,LNCS 575.
L.Fancelli “Méthode de conception mixte asynchrone/synchrone pour la réalisation de systèmes de commande de processus discontinus”, Thèse de docteur en sciences, université de Nice-Sophia-Antipolis, Juillet 90.
T.A.Henzinger, X.Nicollin, J.Sifakis, S.Yovine: “Symbolic Model Checking for Real-Time Systems”. In Procedings of the Seventh iEEE Symposium on Logic in Computer Science, 1992.
P.Merlin, D.J.Farber, “Recovability of communication protocols”. IEEE Trans. on Communications, 24 (1976).
L. Popova. “On Time Petri Nets”, J. Inform. Process. Cybern., EIK 27 (1991) 4.
L. Popova. “Petri Nets with Time Restrictions”, SAMS, 1993, Vol. 13, pp. 13–20.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boucheneb, H., Alger, U., Berthelot, G. (1994). Predicting logical and temporal properties of real-time systems using Synchronized Elementary Nets. In: Langmaack, H., de Roever, WP., Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT ProCoS 1994 1994. Lecture Notes in Computer Science, vol 863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58468-4_167
Download citation
DOI: https://doi.org/10.1007/3-540-58468-4_167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58468-1
Online ISBN: 978-3-540-48984-9
eBook Packages: Springer Book Archive