skip to main content
research-article

Failure Semantics for Modal Transition Systems

Authors Info & Claims
Published:09 September 2015Publication History
Skip Abstract Section

Abstract

With the aim to preserve deadlock freedom, we define a new refinement preorder for modal transition systems (MTSs), using an MTS-specific variant of testing inspired by De Nicola and Hennessy. We characterize this refinement with a kind of failure semantics and show that it “supports itself,” for example, in the sense of thoroughness—in contrast to standard modal refinements. We present a conjunction operator with respect to our new refinement, which is quite different from existing ones. It always returns an MTS—again in contrast to the case of modal refinement. Finally, we also consider De Nicola’s and Hennessy’s may- and must-testing, where the latter leads to a semantics that is also compositional for hiding.

References

  1. Sebastian S. Bauer, Philip Mayer, Andreas Schroeder, and Rolf Hennicker. 2010. On weak modal compatibility, refinement, and the MIO Workbench. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 6015. Springer, 175--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Nikola Beneš, Ivana Černá, and Jan Křetínský. 2011. Modal transition systems: Composition and LTL model checking. In Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, Vol. 6996. Springer, 228--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Stephen D. Brookes, C. Antony R. Hoare, and Andrew W. Roscoe. 1984. A theory of communicating sequential processes. Journal of the ACM 31, 3, 560--599. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Luca de Alfaro and Thomas A. Henzinger. 2001. Interface automata. In Proceedings of the 8th European Software Engineering Conference Held Jointly with the 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering (ESEC’01/FSE-9). ACM, New York, NY, 109--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Rocco De Nicola. 1987. Extensional equivalences for transition systems. Acta Informatica 24, 211--237. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Rocco De Nicola and Matthew Hennessy. 1984. Testing equivalences for processes. Theoretical Computer Science 34, 83--133.Google ScholarGoogle ScholarCross RefCross Ref
  7. Dario Fischbein, Víctor A. Braberman, and Sebastián Uchitel. 2009. A sound observational semantics for modal transition systems. In Theoretical Aspects of Computing. Lecture Notes in Computer Science, Vol. 5684. Springer, 215--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Dario Fischbein and Sebastián Uchitel. 2008. On correct and complete strong merging of partial behaviour models. In Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering (SIGSOFT’08/FSE-16). ACM, New York, NY, 297--307. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Patrice Godefroid, Michael Huth, and Radha Jagadeesan. 2001. Abstraction-based model checking using modal transition systems. In CONCUR 2001—Concurrency Theory. Lecture Notes in Computer Science, Vol. 2154. Springer, 426--440. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Kim G. Larsen. 1990. Modal specifications. In Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, Vol. 407. Springer, 232--246. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Kim G. Larsen, Ulrik Nyman, and Andrzej W¸sowski. 2007a. Modal I/O automata for interface and product line theories. In Programming Languages and Systems. Lecture Notes in Computer Science, Vol. 4421. Springer, 64--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Kim G. Larsen, Ulrik Nyman, and Andrzej W¸sowski. 2007b. On modal refinement and consistency. In CONCUR 2007—Concurrency Theory. Lecture Notes in Computer Science, Vol. 4703. Springer, 105--119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kim G. Larsen and Liu Xinxin. 1990. Equation solving using modal transition systems. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS’90). IEEE, Los Alamitos, CA, 108--117.Google ScholarGoogle Scholar
  14. Gerald Lüttgen and Walter Vogler. 2007. Conjunction on processes: Full abstraction via ready-tree semantics. Theoretical Computer Science 373, 1--2, 19--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Gerald Lüttgen and Walter Vogler. 2011. Safe reasoning with Logic LTS. Theoretical Computer Science 412, 28, 3337--3357.Google ScholarGoogle ScholarCross RefCross Ref
  16. Gerald Lüttgen and Walter Vogler. 2012. Modal interface automata. In Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 7604. Springer, 265--279. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Gerald Lüttgen and Walter Vogler. 2013. Modal interface automata. Logical Methods in Computer Science 9, 3, 1--28.Google ScholarGoogle ScholarCross RefCross Ref
  18. Michael G. Main. 1987. Trace, failure and testing equivalences for communicating processes. International Journal of Parallel Programming 16, 5, 383--400. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Jean-Baptiste Raclet, Eric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, and Roberto Passerone. 2011. A modal interface theory for component-based design. Fundamenta Informaticae 107, 1--2, 119--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Arend Rensink and Walter Vogler. 2007. Fair testing. Information and Computation 205, 2, 125--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Lev Sorokin. 2014. F-Semantik für disjunktive Modale Transitionssysteme. B.Sc. Thesis. Universität Augsburg.Google ScholarGoogle Scholar
  22. Antti Valmari. 1995. Failure-based equivalences are faster than many believe. In Structures in Concurrency Theory. Workshops in Computing 1995. Springer, 326--340.Google ScholarGoogle ScholarCross RefCross Ref
  23. Walter Vogler. 1992. Modular Construction and Partial Order Semantics of Petri Nets. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Failure Semantics for Modal Transition Systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!