A reasoning method for timed CSP based on constraint solving
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Dong, J.S., Hao, P., Sun, J., Zhang, X. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/38953 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Verifying stateful timed CSP using implicit clocks and zone abstraction
by: Sun, J., et al.
Published: (2013) -
Modeling and verifying hierarchical real-time systems using stateful timed CSP
by: Sun, J., et al.
Published: (2013) -
Symbolic model-checking of stateful timed CSP using BDD and digitization
by: Nguyen, T.K., et al.
Published: (2013) -
Translating PDDL into CSP# - The PAT Approach
by: Li, Y., et al.
Published: (2013) -
Model checking CSP revisited: Introducing a process analysis toolkit
by: Sun, J., et al.
Published: (2013)