Results 1  10
of
34,494
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
Exploration of the Syntactical Modeling Capabilities in PROMELA / SPIN of Synergestic Distributed Systems based on any type of wautomata
, 1996
"... Syntactical modeling of synergestic distributed systems in high level specification languages like PROMELA, its validation and simulation under state of the art tools like SPIN is an open field in computer science. We propose an experimental and theoretical extension suitable for PROMELA/SPIN by usi ..."
Abstract
 Add to MetaCart
/SPIN by using the semantic capabilities of PROMELA to express the acceptance condition F of all types of wautomata (Büchi, Muller, Rabin, Street, Kurshan and MannaPnueli) with special never claims constructs. Some examples are illustrated. Key Words : Distributed systems, modeling, validation, wautomata
FINITE
, 1977
"... Abstract. We consider systems of equations of the form Xi=,IJ,a l &~LJ & i=l,...,n where A is the underlying alphabet, the Xi are variables, the Pi.0 are boolean functions in the variables J&B and each & is either the empty word or the empty set. The symbols and u denote concatenati ..."
Abstract
 Add to MetaCart
the language accepted by a sequential network; they are obtainable directly from the network. 1. Notation Let A be a finite alphabet and A * the free monoid generated by A. An element of A is called a letter and an element of A * is called a word over A. The unit element of the monoid A * is the empty word A
Thomas.W.Automata theory on Trees and Partial Orders
 Lecture Notes in Computer Science, Vol. 1214, TAPSOFT 97,SpringerVerlag
, 1998
"... The relationship between the optimal value of word insertion penalty and entropy of the language is discussed, based on the hypothesis that the optimal word insertion penalty compensates the probability given by a language model to the true probability. It is shown that the optimal word insertion pe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The relationship between the optimal value of word insertion penalty and entropy of the language is discussed, based on the hypothesis that the optimal word insertion penalty compensates the probability given by a language model to the true probability. It is shown that the optimal word insertion penalty can be calculated as the difference between test set entropy of the given language model and true entropy of the given test set sentences. The correctness of the idea is confirmed through recognition experiment, where the entropy of the given set of sentences are estimated from two different language models and word insertion penalty optimized for each language model. 1.
Nonconcatenative FiniteState Morphology
 In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics
, 1987
"... this paper to explore the formal properties of finitestate transducers, a brief excursion may be in order at this point to forestall a possible objection to the claim that a parallel configuration of transducers can be combined into a single one. On the face of it, this cannot generally be so becau ..."
Abstract

Cited by 70 (1 self)
 Add to MetaCart
this paper to explore the formal properties of finitestate transducers, a brief excursion may be in order at this point to forestall a possible objection to the claim that a parallel configuration of transducers can be combined into a single one. On the face of it, this cannot generally be so
W.: Using hybrid automata to express realtime properties in VSEII
, 2001
"... In formally analyzing and developing industrial sized systems we are often confronted with the problem of expressing realtime properties. Especially in safety critical applications as, for example, in embedded systems or in control software these properties are crucial for the fight functioning of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
try to overcome this restriction by exploiting the advantages of a (fairly general) formal development tool like VSEolI and the rather specialized Hybrid Automata by combining these two approaches.
Automatic Structures
 IN PROC. 15TH IEEE SYMP. ON LOGIC IN COMPUTER SCIENCE
, 1999
"... We study definability and complexity issues for automatic and wautomatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all firstorder queries. Therefore, automa ..."
Abstract

Cited by 102 (7 self)
 Add to MetaCart
We study definability and complexity issues for automatic and wautomatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all firstorder queries. Therefore
Bounded Model Checking of Infinite State Systems
 Formal Methods in System Design (FMSD) 30 (2007
"... We present a new upproach to bounded nrodel checking that extends currenf nietlzods in two ways: First13 instead of a reduction to propositional logic, we choose a more POWerful, yet decidable target logic, naniely Presburger arithmetic. Secondly instead of unwinding tenrporal logic formulas, we ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
i i ~ i w i ~ d corresponding wautomata. To this end, we eniplny a special technique for translaling safety and liveness properties to wautomata with corresponding acceptance conditions. T12i.s combination allows us to utilize bounded model cliecking rechniques for the eficient verifi
On Finitely Accessible and Finitely . . .
 JOURNAL OF PURE AND APPLIED ALGEBRA 8  1976) 97 104
, 1976
"... ..."
Results 1  10
of
34,494