Results 1  10
of
2,060,070
Onthefly Verification of Finite Transition Systems
, 1993
"... The analysis of programs by the exhaustive inspection of reachable states in a finite state graph is a wellunderstood procedure. It is straightforwardly applicable to many description languages and is actually implemented in several industrial tools. But one of the main limitations of today&apo ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
The analysis of programs by the exhaustive inspection of reachable states in a finite state graph is a wellunderstood procedure. It is straightforwardly applicable to many description languages and is actually implemented in several industrial tools. But one of the main limitations of today
OnTheFly Verification Of Finite Transition Systems
 FORMAL METHODS IN SYSTEM DESIGN
, 1993
"... The analysis of programs by the exhaustive inspection of reachable states in a finite state graph is a wellunderstood procedure It is actually implemented in several industrial tools but one of their main limitations is the size of the memory needed to exhaustively build the state graphs of the pr ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The analysis of programs by the exhaustive inspection of reachable states in a finite state graph is a wellunderstood procedure It is actually implemented in several industrial tools but one of their main limitations is the size of the memory needed to exhaustively build the state graphs
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 760 (41 self)
 Add to MetaCart
, strong and weak observational equivalence of finite transition systems, and language containment for finite wautomata. The fixed point computations for each decision procedure are sometimes complex. but can be concisely expressed in the MuCalculus. We illustrate the practicality of our approach
Modal and Guarded Characterisation Theorems over Finite Transition Systems
 In Proceedings LICS 2002
, 2002
"... We explore the nite model theory of the characterisation theorems for modal and guarded fragments of rstorder logic over transition systems and relational structures of width two. Apart from simplifying Rosen's proof of the nite model theory version of van Benthem's classical modal cha ..."
Abstract

Cited by 25 (14 self)
 Add to MetaCart
We explore the nite model theory of the characterisation theorems for modal and guarded fragments of rstorder logic over transition systems and relational structures of width two. Apart from simplifying Rosen's proof of the nite model theory version of van Benthem's classical modal
Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems
 In Proc. of American Control Conference (ACC
, 2013
"... Abstract — This work is motivated by the problem of synthesizing mode sequences for continuoustime polynomial switched systems in order to guarantee that the trajectories of the system satisfy certain highlevel specifications expressed in linear temporal logic. We use augmented finite transition ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract — This work is motivated by the problem of synthesizing mode sequences for continuoustime polynomial switched systems in order to guarantee that the trajectories of the system satisfy certain highlevel specifications expressed in linear temporal logic. We use augmented finite transition
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1387 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Mathematical Control Theory: Deterministic Finite Dimensional Systems
 of Texts in Applied Mathematics
, 1990
"... The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in contro ..."
Abstract

Cited by 485 (121 self)
 Add to MetaCart
in control theory, except — as the subtitle has warned us — those involving stochastic processes or infinitedimensional systems. The level is appropriate for a senior
A modular threedimensional finitedifference groundwater flow model
 U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1
, 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract

Cited by 507 (5 self)
 Add to MetaCart
of groundwater systems under various initial/boundary conditions and management schemes will be practiced. The emphasis of the student presentations will be based on published papers concerning the applied aspects of groundwater computer modeling utilizing finite difference and analytical computer models
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (33 self)
 Add to MetaCart
finitestate model that approximates the executable behavior of the software system of interest. Current bestpractice involves handconstruction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 525 (44 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Results 1  10
of
2,060,070