Loading...
Please wait, while we are loading the content...
Similar Documents
On the decidability of timed ccp.
| Content Provider | CiteSeerX |
|---|---|
| Author | Valencia, Frank D. |
| Abstract | The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifications. A typical behavioral observation in ccp is the strongest postcondition (sp). The ntcc sp denotes the set of all infinite output sequences that a given process can exhibit. The verification problem is then whether the sequences in the sp of a given process satisfy a given ntcc LTL formula. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Timed Ccp Ntcc Process Calculus Timed Concurrent Constraint Programming Infinite Output Sequence Verification Problem Process Specification Ntcc Sp Process Satisfy First-order Linear-temporal Logic Typical Behavioral Observation Ntcc Ltl Formula |
| Content Type | Text |