Advertisement

Towards a Consistent Semantics for Unsafe Time Petri Nets

  • Abdelkrim Abdelli
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 59)

Abstract

We discuss in this paper the consistency of time Petri net semantics when assuming a monoserver hypothesis. This hypothesis assumes that for a given marking of the net, only one instance of an enabled transition should be considered. We show that for unsafe nets, the standard semantics is not sound and may induce false behaviors in presence of conflicting transitions. To fix this problem, we propose a new semantics that removes these incoherences by managing accurately after each firing the status of enabled transitions. We prove that our semantics is sound when assuming a monoserver hypothesis.

Keywords

Formal Semantic Discrete Event System Accessible State Reachability Graph Standard Semantic 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berthomieu, B., Diaz, M.: Modeling and verification of time dependant systems using Time Petri Nets. IEEE Transactions on Software Engineering 17(3), 259–273 (1991)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Berthomieu, B.: La méthode des classes d’états pour l’analyse des réseaux temporels. In: Modélisation des Systèmes Réactifs (MSR 2001), Toulouse, France (October 2001), pp. 275–290 (2001) HermesGoogle Scholar
  3. 3.
    Boucheneb, H., Rakkay, H.: A More Efficient Time Petri Net State Space Abstraction Useful to Model Checking Timed Linear Properties. Fundam. Inform. 88(4), 469–495 (2008)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Merlin, P.: A study of the recoverability of computer system. PHD Thesis Dep. Computer. Science, Univ. California, Irvine (1974)Google Scholar
  5. 5.
    Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: When are Timed Automata weakly timed bisimilar to Time Petri Nets? Theor. Comput. Sci. 403(2-3), 202–220 (2008)zbMATHCrossRefGoogle Scholar
  6. 6.
    Vicario, E.: Static Analysis and Dynamic Steering of Time-Dependent Systems. IEEE Trans. Software Eng. 27(8), 728–748 (2001)CrossRefGoogle Scholar
  7. 7.
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Abdelkrim Abdelli
    • 1
  1. 1.LSI Laboratory- Computer science DepartmentUSTHB UniversityAlgiersAlgeria

Personalised recommendations