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.
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Rocco De Nicola. 1987. Extensional equivalences for transition systems. Acta Informatica 24, 211--237. Google Scholar
Digital Library
- Rocco De Nicola and Matthew Hennessy. 1984. Testing equivalences for processes. Theoretical Computer Science 34, 83--133.Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- Gerald Lüttgen and Walter Vogler. 2011. Safe reasoning with Logic LTS. Theoretical Computer Science 412, 28, 3337--3357.Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- Gerald Lüttgen and Walter Vogler. 2013. Modal interface automata. Logical Methods in Computer Science 9, 3, 1--28.Google Scholar
Cross Ref
- Michael G. Main. 1987. Trace, failure and testing equivalences for communicating processes. International Journal of Parallel Programming 16, 5, 383--400. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- Arend Rensink and Walter Vogler. 2007. Fair testing. Information and Computation 205, 2, 125--198. Google Scholar
Digital Library
- Lev Sorokin. 2014. F-Semantik für disjunktive Modale Transitionssysteme. B.Sc. Thesis. Universität Augsburg.Google Scholar
- Antti Valmari. 1995. Failure-based equivalences are faster than many believe. In Structures in Concurrency Theory. Workshops in Computing 1995. Springer, 326--340.Google Scholar
Cross Ref
- Walter Vogler. 1992. Modular Construction and Partial Order Semantics of Petri Nets. Springer. Google Scholar
Digital Library
Index Terms
Failure Semantics for Modal Transition Systems
Recommendations
Failure Semantics for Modal Transition Systems
ACSD '14: Proceedings of the 2014 14th International Conference on Application of Concurrency to System DesignWith the aim to preserve deadlock freedom, we define a new refinement relation for modal transition systems (MTS), using an MTS-specific variant of testing in the sense of De Nicola and Hennessy. We characterize this refinement with a kind of failure ...
Comparing refinements for failure and bisimulation semantics
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on ...
On determinism in modal transition systems
Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that ...






Comments