98 citations · 569 across the 35 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LO2022
Fair Must Testing for I/O Automata
Rob van Glabbeek
The concept of must testing is naturally parametrised with a chosen completeness criterion or fairness assumption. When taking weak fairness as used in I/O automata, I show that it…
cs.LO2022
Just Testing
Rob van Glabbeek
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 crit…
cs.LO2022
Abstract Processes in the Absence of Conflicts in General Place/Transition Systems
Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann
Goltz and Reisig generalised Petri's concept of processes of one-safe Petri nets to general nets where places carry multiple tokens. BD-processes are equivalence classes of Goltz-R…