Back to Results
First PageMeta Content
Mathematics / Theory / Structure / Regular language / Model theory / Logic / Metalogic


Concurrency Makes Simple Theories Hard Stefan Göller1 and Anthony Widjaja Lin2 1 2 Fachbereich Informatik, University of Bremen, Germany
Add to Reading List

Document Date: 2012-02-03 05:33:40


Open Document

File Size: 628,73 KB

Share Result on Facebook

Company

A. W. Lin / Creative Commons / Germany S. Göller / Concurrency Makes Simple Theories Hard / Dagstuhl Publishing / /

Currency

pence / /

Event

Reorganization / /

Facility

Oxford University / University of Bremen / /

IndustryTerm

asynchronous products / model checking easier than synchronized products / finite systems / pushdown systems / asynchronous product / concurrent systems / prefix^ recognizable systems / elementary algorithm / prefix-recognizable systems / finite transition systems / finitestate systems / finite-state systems / reachability operator / infinite-state systems / transition systems / product operators / model checking pushdown systems / /

Organization

Germany Department of Computer Science / University of Bremen / Oxford University / /

Person

Thomas Wilke / Modal Logic / Anthony W. Lin / Stefan Göller / Ai / Christoph Dürr / Anthony Widjaja / /

Position

Model / Preliminaries General / /

Product

Proposition 6 / /

Technology

elementary algorithm / Digital Object Identifier / PDA / /

SocialTag