loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Thierry Nicola and Ulrich Ultes-Nitsche

Affiliation: University of Fribourg, Switzerland

Abstract: A major limitation of system and program verification is the state space explosion problem. To avoid this problem, there exists several approaches to reduce the size of the system state space. Some methods try to keep the state space small during the verification run, other methods reduce the original state space prior to the verification. One of the later are abstraction homomorphisms. Weakly Continuation Closed homomorphisms are abstraction homomorphisms preserving exactly those properties of the original behaviour which are satisfied inherently fair [1]. However, the practical use of WCC homomorphisms is limited by the lack of a reasonably efficient algorithm, checking whether or not a homomorphism is WCC and performing reasonably well. This paper presents a result which allows to develop algorithms for WCC on automata.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.190.153.77

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Nicola, T. and Ultes-Nitsche, U. (2008). Weakly Continuation Closed Homomorphisms on Automata. In Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (ICEIS 2008) - MSVVEIS; ISBN 978-989-8111-43-2, SciTePress, pages 39-48. DOI: 10.5220/0001736500390048

@conference{msvveis08,
author={Thierry Nicola. and Ulrich Ultes{-}Nitsche.},
title={Weakly Continuation Closed Homomorphisms on Automata},
booktitle={Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (ICEIS 2008) - MSVVEIS},
year={2008},
pages={39-48},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001736500390048},
isbn={978-989-8111-43-2},
}

TY - CONF

JO - Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (ICEIS 2008) - MSVVEIS
TI - Weakly Continuation Closed Homomorphisms on Automata
SN - 978-989-8111-43-2
AU - Nicola, T.
AU - Ultes-Nitsche, U.
PY - 2008
SP - 39
EP - 48
DO - 10.5220/0001736500390048
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic