Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

CONCUR
2004
Springer

favoriteEmaildiscussreport

126views Distributed And Parallel Com...» more CONCUR 2004»

A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications

14 years 2 months ago

A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications

Download www.lsv.ens-cachan.fr

We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model checking problem against simple modal formulae. As an application, we derive decidability of several regular equivalence problems for well-known families of infinite-state systems.

Antonín Kucera, Ph. Schnoebelen

Real-time Traffic

CONCUR 2004 | Distributed And Parallel Computing | Model Checking Problem | Regular Equivalence Problems | Simple Modal Formulae |

claim paper

Related Content

» A quantitative analysis of memory requirement and generalization performance for robotic t...

» Testing Security Properties of Protocol Implementations a Machine Learning Based Approach

» Symbolic mining of temporal specifications

» Testing a deterministic implementation against a noncontrollable nondeterministic stream X...

» Information extraction from structured documents using ktestable tree automaton inference

» Harnessing Models for Policy Conflict Analysis

» Comparing activity theory with distributed cognition for video analysis beyond kicking the...

» Comparing two testbench methods for hierarchical functional verification of a bluetooth ba...

» A comparative evaluation of agent location mechanisms in large scale MAS

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	CONCUR
Authors	Antonín Kucera, Ph. Schnoebelen

Comments (0)