About: On Decidability of LTL Model Checking for Process Rewrite Systems

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On Decidability of LTL Model Checking for Process Rewrite Systems Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties described by basic fragments of action-based Linear Temporal Logic (LTL) with both future and past operators. It is known that the problem for general LTL properties is decidable for Petri nets and for pushdown processes, while it is undecidable for PA processes. We show that the problem is decidable for wPRS if we consider properties defined by LTL formulae with only modalities strict eventually, strict always, and their past counterparts. Moreover, we show that the problem remains undecidable for PA processes even with respect to the LTL fragment with the only modality until or the fragment with modalities next and infinitely often. We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties described by basic fragments of action-based Linear Temporal Logic (LTL) with both future and past operators. It is known that the problem for general LTL properties is decidable for Petri nets and for pushdown processes, while it is undecidable for PA processes. We show that the problem is decidable for wPRS if we consider properties defined by LTL formulae with only modalities strict eventually, strict always, and their past counterparts. Moreover, we show that the problem remains undecidable for PA processes even with respect to the LTL fragment with the only modality until or the fragment with modalities next and infinitely often. (en)
Title	On Decidability of LTL Model Checking for Process Rewrite Systems On Decidability of LTL Model Checking for Process Rewrite Systems (en)
skos:prefLabel	On Decidability of LTL Model Checking for Process Rewrite Systems On Decidability of LTL Model Checking for Process Rewrite Systems (en)
skos:notation	RIV/00216224:14330/09:00029078!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/06/1338), P(GP201/08/P375), Z(MSM0021622419)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Řehák, Vojtěch Strejček, Jan Křetínský, Mojmír
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	331365
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/09:00029078
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	infinite-state systems; linear time logic; decidability; model checking (en)
http://linked.open.../riv/klicoveSlovo	linear time logic decidability model checking infinite-state systems
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[2B5C4B4D30C9]
http://linked.open...i/riv/nazevZdroje	Acta informatica
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Automated software verification Formal verification: algorithms, properties of modelling formalisms and temporal logics Institute for Theoretical Computer Science
http://linked.open...UplatneniVysledku	2009
http://linked.open...v/svazekPeriodika	46
http://linked.open...iv/tvurceVysledku	Řehák, Vojtěch Strejček, Jan Křetínský, Mojmír Bozzelli, Laura
http://linked.open...ain/vavai/riv/wos	000262531800001
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0001-5903
number of pages	28 (xsd:int)
http://localhost/t...ganizacniJednotka	14330
is http://linked.open...avai/riv/vysledek of	On Decidability of LTL Model Checking for Process Rewrite Systems On Decidability of LTL Model Checking for Process Rewrite Systems On Decidability of LTL Model Checking for Process Rewrite Systems On Decidability of LTL Model Checking for Process Rewrite Systems

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software