Back to Results
First PageMeta Content
Metalogic / Proof theory / Temporal logic / Logic in computer science / Linear temporal logic / Presburger arithmetic / PAT / Model checking / Satisfiability / Mathematical logic / Logic / Model theory


Taming Past LTL and Flat Counter Systems Stéphane Demria , Amit Kumar Dharb , Arnaud Sangnierb a b
Add to Reading List

Document Date: 2015-03-26 04:34:20

Open Document

File Size: 888,48 KB

Share Result on Facebook

City

CNRS / /

Company

Flat Counter Systems / /

/

IndustryTerm

model-checking infinite-state systems / admissible counter systems / counter systems / equation systems / nondeterministic algorithms / infinite state-systems / finite-state systems / satisfactory solution / integer solutions / model-checking relational counter systems / infinite-state systems / /

Organization

E. So lab / European Union / /

Person

Arnaud Sangnierb / Amit Kumar Dharb / Stéphane Demria / Stéphane Demri / Amit Kumar Dhar / Arnaud Sangnier / /

/

Position

vp / /

ProvinceOrState

North Carolina / /

Technology

forthcoming nondeterministic algorithms / /

SocialTag