SIGN IN
SIGN UP
Undecidability of bisimilarity by defender's forcing
Full Text:
PDF
Buy this Article
Authors:
Petr Jančar
Technical University of Ostrava, Ostrava -- Poruba, Czech Republic
Jivří Srba
Aalborg University, Aalborg East, Denmark
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 55 Issue 1, February 2008
Article No. 5
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1326554.1326559
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 33
· Downloads (cumulative): 473
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
bisimilarity
decision problems
process algebra
process models
pushdown automata
theory
undecidability
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder