OpenAlex
PricingAboutJobs
Log inGet started
Work

Alternating refinement relations

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: CONCUR'98 Concurrency Theory: 9th International Conference Nice, France, September 8–11, 1998 Proceedings
DOI: 10.1007/bfb0055622
Authors: Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi
Institutions: University of Pennsylvania, University of California System, University of California, Berkeley, Rice University
Language: English

Topic: Formal Methods in Verification
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: refinement relations, simulation preorder, composite systems, game semantics, EXPTIME-completeness, PSPACE-completeness, fixpoint computation, logical characterization

Open Access status: closed

Funder: Defense Advanced Research Projects Agency
OpenAlex ID: W1606443439
FWCI: 3.526
Cites: 15
Cited by: 378
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security