ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...
Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Oste...
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...