Techniques for Abstracting SDL Specifications

S Boroday, R Groz, A Petrenko… - … and beyond: The …, 2003 - Springer
Abstracting the behaviour of a specification is a key technique for dealing with the
complexity of such tasks as reachability analysis and test generation. We adapted classical …

Temporal relationship extension of state machine observer

D Baca - US Patent 10,445,169, 2019 - Google Patents
A method includes receiving a first progress request from a first state machine associated
with execution of a first thread on a processor. The method includes updating a current state …

Model-based monitoring of discrete-event systems

Y Park - 1996 - search.proquest.com
Abstract A Discrete Event System (DES) is a dynamic system in which the state of the system
changes instantaneously in response to the occurrence of events. DESs arise as models of …

A framework for inferential problems in DEDS. I. TTM based modeling

S Mukhopadhay, P Bhowal… - Smc 2000 conference …, 2000 - ieeexplore.ieee.org
Presents a timed automata approach for modeling discrete event dynamic systems (DEDS)
in the context of supervision and monitoring of industrial processes by extending the TTM …

A framework for inferential problems in DEDS. III. Fault diagnosis

S Mukhopadhay, P Bhowal… - Smc 2000 conference …, 2000 - ieeexplore.ieee.org
For pt. II, see ibid., pp. 2168-73 (2000). Discusses the problem of fault diagnosis in a discrete
event dynamic system (DEDS). We consider the timed transition model (TTM) framework for …

On a class of optimal abstractions of finite-state machines

KN Oikonomou - Formal Methods in System Design, 1996 - Springer
An abstraction A of an fsm M consists in partitioning its states, inputs, and outputs into
groups, thus turning it into a non-deterministic fsm MA. For fixed sets of states, inputs, and …

[PDF][PDF] Techniques for Abstracting SDL Specifications

F Télécom-R&D - researchgate.net
Abstracting the behaviour of a specification is a key technique for dealing with the
complexity of such tasks as reachability analysis and test generation. We adapted classical …

Abstractions of Random Finite-State Machines

KN Oikonomou - Formal Methods in System Design, 2001 - Springer
Suppose that M is a large, complex finite-state system (fsm), and we want to construct a
smaller model of it. A way of doing so, independent of any special properties that M might …