Results 1  10
of
2,379
Reactive Modules
 FORMAL METHODS IN SYSTEM DESIGN
, 1996
"... We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assumeguarantee) and hierarchical (stepwiserefinement) design and verification. While synchronous models are based on a notion of at ..."
Abstract

Cited by 325 (38 self)
 Add to MetaCart
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assumeguarantee) and hierarchical (stepwiserefinement) design and verification. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal detail. For describing systems at various levels of spatial detail, we use a hiding operator that may turn a synchronous system into an asynchronous one. We illustrate the model with diverse examples from synchronous circuits, asynchronous sharedm...
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 362 (11 self)
 Add to MetaCart
Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy
Confirming Configurations in EFSM Testing
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2004
"... In this paper, we investigate the problem of configuration verification for the extended FSM (EFSM) model. This is an extension of the FSM state identification problem. Specifically, given a configuration ("state vector") and an arbitrary set of configurations, determine an input sequenc ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
In this paper, we investigate the problem of configuration verification for the extended FSM (EFSM) model. This is an extension of the FSM state identification problem. Specifically, given a configuration ("state vector") and an arbitrary set of configurations, determine an input
A generic process algebra
 Proc. of the Workshop Essays on Algebraic Process Calculi (APC 25), volume 162 of Electr. Notes Theor. Comput. Sci
, 2006
"... Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process algebra ..."
Abstract

Cited by 251 (21 self)
 Add to MetaCart
Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process algebras. A hybrid process algebra can be used for the specification, simulation, control and verification of embedded systems in combination with their environment, and for any dynamic system in general. As the vehicle of our exposition, we use the hybrid process algebra χ (Chi). The syntax and semantics of χ are discussed, and it is explained how equational reasoning simplifies tool implementations for simulation and verification. A bottle filling line example is introduced to illustrate system analysis by means of equational reasoning.
A Theoretical and Empirical Study of EFSM Dependence
"... Dependence analysis underpins many activities in software maintenance such as comprehension and impact analysis. As a result, dependence has been studied widely for programming languages, notably through work on program slicing. However, there is comparatively little work on dependence analysis at t ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
at the model level and hitherto, no empirical studies. We introduce a slicing tool for Extended Finite State Machines (EFSMs) and use the tool to gather empirical results on several forms of dependence found in ten EFSMs, including wellknown benchmarks in addition to realworld EFSM models. We investigate
Protocol Verification with Reactive Promela/RSPIN
 In Proceedings of the Second SPIN Workshop, Rutgers University
, 1996
"... Reactive Promela/RSPIN is an extension to the protocol validator Promela/SPIN. It enhances the simulation and verification capabilities of SPIN by allowing modular specifications to be analysed while alleviating the statespace explosion problem. Reactive Promela is a simple reactive language. The t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Reactive Promela/RSPIN is an extension to the protocol validator Promela/SPIN. It enhances the simulation and verification capabilities of SPIN by allowing modular specifications to be analysed while alleviating the statespace explosion problem. Reactive Promela is a simple reactive language
EDALab – Networked Embedded Systems Automatic Transactor Generation in TLM by Exploiting EFSMs ∗
"... Abstract — One of the main critical tasks in a design flow based on Transaction Level Modeling (TLM) is the implementation of transactors. In fact, even if transactors represent the key objects to allow TLMRTL mixed simulation, testbench and assertion reuse, their implementation is still manual, te ..."
Abstract
 Add to MetaCart
, tedious and errorprone. The paper firstly classifies two scenarios as starting points to generate transactors and then, for each scenario, a suitable methodology is presented to automate the generation process exploiting the Extended Finite State Machine (EFSM) model. I.
Testing reactive systems with GAST
 In S. Gilmore, Trends in Functional Programming 4
, 2003
"... GAST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute the tests, and to evaluate the results of these tests. ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
GAST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute the tests, and to evaluate the results of these tests.
Verification of Reactive Systems
"... ion 42 10.1 A Simple Sufficient Condition : : : : : : : : : : : : : : : : : : : : : : : : : 42 11 !Automata 44 11.1 From Fair Kripke Structures to !Automata : : : : : : : : : : : : : : : : : 46 11.2 Stuttering Robustness : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 48 11.3 Automata Re ..."
Abstract
 Add to MetaCart
ion 42 10.1 A Simple Sufficient Condition : : : : : : : : : : : : : : : : : : : : : : : : : 42 11 !Automata 44 11.1 From Fair Kripke Structures to !Automata : : : : : : : : : : : : : : : : : 46 11.2 Stuttering Robustness : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 48 11.3 Automata
Regular Inference for Reactive Systems
, 2006
"... Models of reactive systems play a central role in many techniques for verification and analysis of reactive systems. Both a specification of the system and the abstract behavior of the system can be expressed in a formal model. Compliance with the functional parts in the specification can be control ..."
Abstract
 Add to MetaCart
Models of reactive systems play a central role in many techniques for verification and analysis of reactive systems. Both a specification of the system and the abstract behavior of the system can be expressed in a formal model. Compliance with the functional parts in the specification can
Results 1  10
of
2,379