Sciweavers

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

89

Voted

CONCUR
2005
Springer

76views Distributed And Parallel Com...» more CONCUR 2005»

Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces

15 years 8 months ago

Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces

Download www.liafa.jussieu.fr

Paul Gastin, Dietrich Kuske

Real-time Traffic

CONCUR 2005 |

claim paper

Related Content

» Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces

» Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets

» On FirstOrder Fragments for Mazurkiewicz Traces

» Modelchecking Trace Event Structures

» Detecting Temporal Logic Predicates on Distributed Computations

» Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CONCUR
Authors	Paul Gastin, Dietrich Kuske

Comments (0)