Efficient parallel path checking for linear-time temporal logic with past and bounds (Q4899110)
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 6122238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel path checking for linear-time temporal logic with past and bounds |
scientific article; zbMATH DE number 6122238 |
Statements
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds (English)
0 references
7 January 2013
0 references
linear-time temporal logic (LTL)
0 references
linear-time temporal logic with past
0 references
bounded temporal operators
0 references
model checking
0 references
path checking
0 references
parallel complexity
0 references
0.8810146450996399
0 references
0.8090975284576416
0 references
0.7929052114486694
0 references
0.778271496295929
0 references
