Relating fair testing and accordance for service replaceability

Mooij, AJ Arjan; Stahl, Christian; Voorhoeve, Marc

doi:10.1016/j.jlap.2009.12.001

Cited by 14 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we are interested in using such representations to decide the coarsest precongruences. Another issue is the minimal requirement weak termination (e.g., [21,23]): Reaching a final state should always be possible. This criterion is very close to the idea of should testing, but it is not clear how to characterize the respective accordance (which is a precongruence itself).…”

Section: Resultsmentioning

confidence: 99%

“…That standard language inclusion can be too strict has been observed for a stronger criterion than b-responsiveness in [21,5,23]. Mooij et al [23] propose two solutions to overcome this problem.…”

Section: A Trace-based Semantics For Bounded Responsivenessmentioning

confidence: 99%

“…Mooij et al [23] propose two solutions to overcome this problem. The first idea is to restrict the class of open nets considered to those where every place and transition can be covered.…”

Section: A Trace-based Semantics For Bounded Responsivenessmentioning

confidence: 99%

See 2 more Smart Citations

Trace- and failure-based semantics for responsiveness

2014

Self Cite

View full text Add to dashboard Cite

Abstract.We study open systems modeled as Petri nets with an interface for asynchronous (i.e., buffered) communication with other open systems. As a minimal requirement for successful communication, we investigate responsiveness, which guarantees that an open system and its environment always have the possibility to communicate. We investigate responsiveness with and without final states and also their respective bounded variants, where the number of pending messages never exceeds a previously known bound. Responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for each accordance variant. As none of the relations turns out to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in each relation, using a variation of should testing. For the two unbounded variants, the precongruences are not decidable, but for the two bounded variants we show decidability.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: A Trace-based Semantics For Bounded Responsivenessmentioning

confidence: 99%

See 1 more Smart Citation

Trace- and failure-based semantics for responsiveness

2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…We showed undecidability of accordance for five behavioral properties: deadlock freedom [3] and responsiveness [4]-both with and without final markings-and weak termination [5].…”

Section: Related Work and Conclusionmentioning

confidence: 92%

“…A natural question is whether this previously known bound is necessary. In this paper, we give a negative answer: We prove that accordance is undecidable for deadlock freedom and responsiveness-both with and without final statesand weak termination [5] (i.e., the perpetual possibility to reach a final state).…”

Section: Introductionmentioning

confidence: 98%

Undecidability of accordance for open systems with unbounded message queues

Müller

Stahl

Vogler

2014

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

We study asynchronously communicating open systems modeled as Petri nets with an interface. An accordance preorder describes when one open system can be safely replaced by another open system without affecting some behavioral property of the overall system. Although accordance is decidable for several behavioral properties if we assume a previously known bound on the maximal number of pending messages, we show that it is not decidable without this assumption.

show abstract

Certainly Unsupervisable States

Ware

Malik

Mohajerani

et al. 2014

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. This paper proposes an abstraction method for compositional synthesis. Synthesis is a method to automatically compute a control program or supervisor that restricts the behaviour of a given system to ensure safety and liveness. Compositional synthesis uses repeated abstraction and simplification to combat the state-space explosion problem for large systems. The abstraction method proposed in this paper finds and removes the so-called certainly unsupervisable states. By removing these states at an early stage, the final state space can be reduced substantially. The paper describes an algorithm with cubic time complexity to compute the largest possible set of removable states. A practical example demonstrates the feasibility of the method to solve real-world problems.

show abstract

Relating fair testing and accordance for service replaceability

Cited by 14 publications

References 25 publications

Trace- and failure-based semantics for responsiveness

Trace- and failure-based semantics for responsiveness

Undecidability of accordance for open systems with unbounded message queues

Certainly Unsupervisable States

Contact Info

Product

Resources

About