KUČERA, Antonín and Jan STREJČEK. Characteristic Patterns for LTL. P. Vojtas, M. Bielikova, B. Charron-Bost, O. Sykora (Eds.). In SOFSEM 2005: Theory and Practice of Computer Science. Berlin, Heidelberg: Springer-Verlag, 2005, p. 239-249. ISBN 3-540-24302-X.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Characteristic Patterns for LTL
Name in Czech Charakteristické vzorce pro LTL
Authors KUČERA, Antonín (203 Czech Republic, guarantor) and Jan STREJČEK (203 Czech Republic).
P. Vojtas, M. Bielikova, B. Charron-Bost, O. Sykora (Eds.).
Edition Berlin, Heidelberg, SOFSEM 2005: Theory and Practice of Computer Science, p. 239-249, 11 pp. 2005.
Publisher Springer-Verlag
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Slovakia
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/05:00012348
Organization unit Faculty of Informatics
ISBN 3-540-24302-X
UT WoS 000228554400027
Keywords in English model-checking; linear temporal logic
Tags linear temporal logic, Model-Checking
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 29/3/2010 14:38.
Abstract
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings further results about various LTL fragments. We also propose a generic method for decomposing LTL formulae into an equivalent disjunction of "semantically refined" LTL formulae, and indicate how this result can be used to improve the functionality of existing LTL model-checkers.
Abstract (in Czech)
Popisujeme nové charakterizace jazyků, které jsou definovatelné pomocí fragmentů LTL s danou hloubkou zanoření operátorů X a U. Tyto charakterizace využívá nově navržená obecná metoda rozkladu LTL formule na ekvivalentní disjunkci "sémanticky jemnějších" formulí. Dále ukazujeme, jak může být tento rozklad použit k vylepšení existujících nástrojů pro LTL model checking.
Links
GA201/03/1161, research and development projectName: Verifikace nekonečně stavových systémů
Investor: Czech Science Foundation, Verification of infinite-state systems
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 12/10/2024 20:34