Just Testing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

The concept of must testing is naturally parametrised with a chosen completeness criterion, defining the complete runs of a system. Here I employ justness as this completeness criterion, instead of the traditional choice of progress. The resulting must-testing preorder is incomparable with the default one, and can be characterised as the fair failure preorder of Vogler. It also is the coarsest precongruence preserving linear time properties when assuming justness.
As my system model I here employ Petri nets with read arcs. Through their Petri net semantics, this work applies equally well to process algebras. I provide a Petri net semantics for a standard process algebra extended with signals; the read arcs are necessary to capture those signals.
Original languageEnglish
Title of host publicationProceedings 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023)
Subtitle of host publicationheld as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2023), Paris, France, April 2023
EditorsOrna Kupferman, Pawel Sobocinski
Number of pages22
ISBN (Electronic)9783031308291
ISBN (Print)9783031308284
Publication statusPublished - 21 Apr 2023
EventFoundations of Software Science and Computation Structures: Part of the European joint conferences on theory & practice of software 2023 - Paris, France
Duration: 22 Apr 202327 Apr 2023

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceFoundations of Software Science and Computation Structures
Abbreviated titleFoSSaCS 2023
Internet address


Dive into the research topics of 'Just Testing'. Together they form a unique fingerprint.

Cite this