SIGN IN
SIGN UP
Compositional verification of concurrent systems using Petri-net-based condensation rules
Full Text:
Pdf
Buy this Article
Authors:
Eric Y. T. Juan
University of Illinois at Chicago
Jeffrey J. P. Tsai
University of Illinois at Chicago
Tadao Murata
University of Illinois at Chicago
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 20 Issue 5, Sept. 1998
Pages 917 - 979
ACM
New York, NY
, USA
table of contents
doi>
10.1145/293677.293681
1998 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 32
· Downloads (cumulative): 1,083
· Citation Count: 17
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
boundedness
compositional verification
deadlock states
experimentation
mechanical verification
petri nets
programming by contract
reachability analysis
reachability graphs
reachable markings
reliability
theory
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