Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2012
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186566057985
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6368
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2012
publishDateSort 2012
record_format rss_article
spellingShingle Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_auth Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_full Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_fullStr Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_full_unstemmed Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_short Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
title_sort efficient parallel path checking for linear-time temporal logic with past and bounds
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-8(4:10)2012