Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2136589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability of infinite-state timed CCP processes and first-order LTL |
scientific article; zbMATH DE number 2136589 |
Statements
Decidability of infinite-state timed CCP processes and first-order LTL (English)
0 references
22 February 2005
0 references
Process calculi
0 references
Timed concurrent constraint programming
0 references
Infinite-state systems
0 references
Temporal logic
0 references
First-order LTL
0 references
Decidability
0 references
0.9597288370132446
0 references
0.8049287796020508
0 references
0.8001272678375244
0 references
0.7667953968048096
0 references
0.7584892511367798
0 references
