Sciweavers

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

12

CONCUR
2004
Springer

favoriteEmaildiscussreport

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

Model Checking Restricted Sets of Timed Paths

13 years 10 months ago

Model Checking Restricted Sets of Timed Paths

Download www.lsv.ens-cachan.fr

In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single ﬁnite (or ultimately periodic) timed path, (ii) a inﬁnite set of ﬁnite (or inﬁnite) timed paths deﬁned by a ﬁnite (or ultimately periodic) path in a region graph, (iii) a inﬁnite set of ﬁnite (or inﬁnite) timed paths deﬁned by a ﬁnite (or ultimately periodic) path in a zone graph.

Nicolas Markey, Jean-François Raskin

Real-time Traffic

CONCUR 2004 | Important Real-time Logics | Inﬁnite Set | Timed Paths |

claim paper

Related Content

» PlatformSpecific Restrictions on Concurrency in Model Checking of Java Programs

» Approximate Model Checking of PCTL Involving Unbounded Path Properties

» Optimal PNNI complex node representations for restrictive costs

» Checking and deriving module paths in Verilog cell library descriptions

» Model Checking Real Time Java Using Java PathFinder

» Shortest paths between shortest paths and independent sets

» Analysis of Gene Interactions Using Restricted Boolean Networks and TimeSeries Data

» Stubborn Sets for Model Checking the EFAG Fragment of CTL

» Linear Time Membership for a Class of XML Types with Interleaving and Counting

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CONCUR
Authors	Nicolas Markey, Jean-François Raskin

Comments (0)