Weakly Continuation Closed Homomorphisms on Automata

Thierry Nicola, Ulrich Ultes-Nitsche

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.

References

  1. 4. Dams, D., Gerth, R., Knaack, B., Kuiper, R.: Partial-order reduction techniques for real-time model checking. Formal Asp. Comput. 10 (1998) 469-482
  2. 5. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley Longman (2001)
  3. 6. Thomas, W.: Automata on infinite objects. In van Leeuwen, J., ed.: Formal Models and Semantics. Volume B of Handbook of Theoretical Computer Science., Elsevier (1990) 133- 191
  4. 7. Ultes-Nitsche, U.: A power-set construction for reducing Büchi automata to nondeterminism degree two. Information Processing Letters (IPL) 101 (2007) 107-111
  5. 8. Nitsche, U., Ochsenschläger, P.: Approximately satisfied properties of systems and simple language homomorphisms. I Information Processing Letters 60 (1996)
  6. 9. Nicola, T., Niessner, F., Ultes-Nitsche, U.: Model-checking inherently fair linear-time properties. In: Proceedings of the 3rd International Workshop on Modelling, Simulation, Verification, and Validation of Enterprise Information Systems (MSVVEIS 2005), Miami, Florida, USA (2005) 3-8
  7. 10. Francez, N.: Fairness. Springer Verlag (1986)
  8. 11. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press (1999)
Download


Paper Citation


in Harvard Style

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 - Volume 1: MSVVEIS, (ICEIS 2008) ISBN 978-989-8111-43-2, pages 39-48. DOI: 10.5220/0001736500390048


in Bibtex Style

@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 - Volume 1: MSVVEIS, (ICEIS 2008)},
year={2008},
pages={39-48},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001736500390048},
isbn={978-989-8111-43-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2008)
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