Generating finite-state abstractions of reactive systems using decision procedures

1998 ◽  
pp. 293-304 ◽  
Author(s):  
Michael A. Colón ◽  
Tomás E. Uribe
Keyword(s):  
Reactive Systems ◽  
Decision Procedures ◽  
Finite State

Statechart-based Controllers Synthesis in FPGA Structures with Embedded Array Blocks

2010 ◽  
Vol 56 (1) ◽  
pp. 13-24 ◽  
Author(s):  
Grzegorz Łabiak ◽  
Grzegorz Borowik
Keyword(s):  
Complex Systems ◽  
Finite State Machine ◽  
Reactive Systems ◽  
State Machine ◽  
Embedded Memory ◽  
Digital Controllers ◽  
Functional Decomposition ◽  
Finite State ◽  
Implementation Scheme ◽  
Programmable Devices

Statechart-based Controllers Synthesis in FPGA Structures with Embedded Array BlocksStatechart diagrams, in general, are visual formalism for description of complex systems behaiour. Digital controllers, which act as reactive systems, can be very conveniently modeled with statecharts and efficiently synthesized in modern programmable devices. The paper presents in details syntax and semantics of statecharts and new implementation scheme. The issue of statecharts synthesis is not still ultimately solved. Main feature of the presented approach is the transformation of statechart diagrams into Finite State Machine, and through KISS format, functional decomposition and mapping into Embedded Memory Blocks. Embedded Memory are part of the modern programmable devices.

scholarly journals Automatic verification of timed concurrent constraint programs

2006 ◽  
Vol 6 (3) ◽  
pp. 265-300 ◽  
Author(s):  
MORENO FALASCHI ◽  
ALICIA VILLANUEVA
Keyword(s):  
Model Checking ◽  
Infinite Number ◽  
Reactive Systems ◽  
Finite Model ◽  
Computation Model ◽  
Huge Number ◽  
Finite State ◽  
Infinite State Systems ◽  
Infinite State ◽  
Concurrent Constraint Programming

The language Timed Concurrent Constraint (tccp) is the extension over time of the Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent systems where timing is critical, for example reactive systems. Systems which may have an infinite number of states can be specified in tccp. Model checking is a technique which is able to verify finite-state systems with a huge number of states in an automatic way. In the last years several studies have investigated how to extend model checking techniques to systems with an infinite number of states. In this paper we propose an approach which exploits the computation model of tccp. Constraint based computations allow us to define a methodology for applying a model checking algorithm to (a class of) infinite-state systems. We extend the classical algorithm of model checking for LTL to a specific logic defined for the verification of tccp and to the tccp Structure which we define in this work for modeling the program behavior. We define a restriction on the time in order to get a finite model and then we develop some illustrative examples. To the best of our knowledge this is the first approach that defines a model checking methodology for tccp.

scholarly journals On the Expressive Power of Some Extensions of Linear Temporal Logic

2018 ◽  
Vol 25 (5) ◽  
pp. 506-524
Author(s):  
Anton Gnatenko ◽  
Vladimir Zakharov
Keyword(s):  
Temporal Logic ◽  
Reactive Systems ◽  
Expressive Power ◽  
Linear Temporal Logic ◽  
Reactive System ◽  
Formal Specifications ◽  
Control Signals ◽  
Finite State ◽  
Finite State Transducer ◽  
Output Alphabet

One of the most simple models of computation which is suitable for representation of reactive systems behaviour is a finite state transducer which operates over an input alphabet of control signals and an output alphabet of basic actions. The behaviour of such a reactive system displays itself in the correspondence between flows of control signals and compositions of basic actions performed by the system. We believe that the behaviour of this kind requires more suitable and expressive means for formal specifications than the conventionalLT L. In this paper, we define some new (as far as we know) extensionLP-LT Lof Linear Temporal Logic specifically intended for describing the properties of transducers computations. In this extension the temporal operators are parameterized by sets of words (languages) which represent distinguished flows of control signals that impact on a reactive system. Basic predicates in our variant of the temporal logic are also languages in the alphabet of basic actions of a transducer; they represent the expected response of the transducer to the specified environmental influences. In our earlier papers, we considered a model checking problem forLP-LT LandLP-CT Land showed that this problem has effective solutions. The aim of this paper is to estimate the expressive power ofLP-LT Lby comparing it with some well known logics widely used in the computer science for specification of reactive systems behaviour. We discovered that a restricted variant LP-1-LT Lof our logic is more expressive thanLTLand another restricted variantLP-n-LT Lhas the same expressive power as monadic second order logic S1S.

scholarly journals ON SOME PROPERTIES OF TIMED FINITE STATE MACHINES

2020 ◽  
Author(s):  
Evgeniy Maximovich Vinarskii ◽  
◽  
Vladimir Anatolyevoch Zakharov ◽  
Keyword(s):  
Real Time ◽  
Computational Linguistics ◽  
Input Data ◽  
Formal Model ◽  
Reactive Systems ◽  
Real Life ◽  
Reactive System ◽  
Formal Models ◽  
Reactive Behavior ◽  
Finite State

Sequential reactive systems are formal models of programs that interact with the environment by receiving inputs and producing corresponding outputs. Such formal models are widely used in software engineering, computational linguistics, telecommunication, etc. In real life, the behavior of a reactive system depends not only on the flow of input data, but also on the time the input data arrive and the delays that occur when generating responses. To capture these aspects, a timed finite state machine (TFSM) is used as a formal model of a real-time sequential reactive system. However, in most of known previous works, this model was considered in simplified semantics: the responses in the output stream, regardless of their timestamps, follow in the same order in which the corresponding inputs are delivered to the machine. This simplification makes the model easier to analyze and manipulate, but it misses many important aspects of real-time computation. In this paper we study a refined semantics of TFSMs and show how to represent it by means of Labelled Transition Systems. This opens up a possibility to apply traditional formal methods for verifying more subtle properties of real-time reactive behavior which were previously ignored.

scholarly journals On the Model Checking Problem for Some Extension of CTL*

2020 ◽  
Vol 27 (4) ◽  
pp. 428-441
Author(s):  
Anton Romanovich Gnatenko ◽  
Vladimir Anatolyevich Zakharov
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Reactive Systems ◽  
Expressive Power ◽  
Binary Relations ◽  
Temporal Logics ◽  
Distinctive Features ◽  
Verification Problem ◽  
Finite State ◽  
Infinite Sequences

Sequential reactive systems include programs and devices that work with two streams of data and convert input streams of data into output streams. Such information processing systems include controllers, device drivers, computer interpreters. The result of the operation of such computing systems are infinite sequences of pairs of events of the request-response type, and, therefore, finite transducers are most often used as formal models for them. The behavior of transducers is represented by binary relations on infinite sequences, and so, traditional applied temporal logics (like HML, LTL, CTL, mu-calculus) are poorly suited as specification languages, since omega-languages, not binary relations on omega-words are used for interpretation of their formulae. To provide temporal logics with the ability to define properties of transformations that characterize the behavior ofreactive systems, we introduced new extensions ofthese logics, which have two distinctive features: 1) temporal operators are parameterized, and languages in the input alphabet oftransducers are used as parameters; 2) languages in the output alphabet oftransducers are used as basic predicates. Previously, we studied the expressive power ofnew extensions Reg-LTL and Reg-CTL ofthe well-known temporal logics oflinear and branching time LTL and CTL, in which it was allowed to use only regular languages for parameterization of temporal operators and basic predicates. We discovered that such a parameterization increases the expressive capabilities oftemporal logic, but preserves the decidability of the model checking problem. For the logics mentioned above, we have developed algorithms for the verification of finite transducers. At the next stage of our research on the new extensions of temporal logic designed for the specification and verification of sequential reactive systems, we studied the verification problem for these systems using the temporal logic Reg-CTL*, which is an extension ofthe Generalized Computational Tree Logics CTL*. In this paper we present an algorithm for checking the satisfiability of Reg-CTL* formulae on models of finite state transducers and show that this problem belongs to the complexity class ExpSpace.

Formal Methods for Verifications of Reactive Systems

2011 ◽  
pp. 376-415
Author(s):  
Olfa Mosbahi ◽  
Mohamed Khalgui
Keyword(s):  
Theorem Proving ◽  
Reactive Systems ◽  
Prototype System ◽  
Model Checker ◽  
B Method ◽  
Liveness Properties ◽  
Finite State ◽  
Infinite State Systems ◽  
Sorting System ◽  
Event B Method

This chapter deals with the use of two verification approaches: theorem proving and model checking. The authors focus on the Event-B method by using its associated theorem proving tool (Click_n_Prove), and on the language TLA+ by using its model checker TLC. By considering the limitation of the Event-B method to invariance properties, the authors propose to apply the language TLA+ to verify liveness properties on a software behavior. The authors extend first the expressivity and the semantics of a B model (called temporal B model) to deal with the specification of fairness and eventuality properties. Second, they give transformation rules from a temporal B model into a TLA+ module. The authors present in particular, their prototype system called B2TLA+, that they have developed to support this transformation; then they can verify these properties thanks to the model checker TLC on finite state systems. For the verification of infinite-state systems, they propose the use of the predicate diagrams. The authors illustrate their approach on a case study of a parcel sorting system.

Sign in / Sign up

Export Citation Format

Share Document