Failure Semantics for Modal Transition Systems
Authors:
- Ferenc BujtorFBFerenc Bujtor
- Walter VoglerWVWalter Vogler
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 42-51
Abstract
With 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 semantics, and we show that it 'supports itself' e.g. in the sense of thoroughness - in contrast to the standard modal refinement. We present a conjunction operator w.r.t. our new refinement, this operator is very different from others found in the literature, and it demonstrates that the conjunction of two MTSs is an MTS - again in contrast to the case of modal refinement. Finally, we also consider a may-testing approach.Keywords
This publication has 16 references indexed in Scilit:
- Modal Interface AutomataLogical Methods in Computer Science, 2013
- Safe reasoning with Logic LTSTheoretical Computer Science, 2011
- On correct and complete strong merging of partial behaviour models2008
- Conjunction on processes: Full abstraction via ready-tree semanticsTheoretical Computer Science, 2007
- Interface-Based Design2005
- Equation solving using modal transition systems2002
- Abstraction-Based Model Checking Using Modal Transition Systems2001
- Modal specifications1990
- Trace, failure and testing equivalences for communicating processesInternational Journal of Parallel Programming, 1987
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984