J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. Accepted paper for SPIN'01, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Net Reductions for LTL Model-Checking - Esparza, Schröter Self-citation (Esparza) (Correct)
No context found.
J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. Accepted paper for SPIN'01, 2001.
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2002) (3 citations) Self-citation (Esparza Heljanko) (Correct)
No context found.
J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001. Available at #http://www.tcs.hut.fi/Publications/reports/A68abstract.html#.
Combining Symbolic and Partial Order Methods for Model Checking.. - Heljanko (2002) (3 citations) Self-citation (Heljanko) (Correct)
....jointly developed while the current author was visiting Technische Universitt Mnchen. Some key proof ideas on the tableaux side of [20] are due to J. Esparza, whereas the proofs of the used synchronization construction are by current author. The publication [P4] as well as the extended version [22]) is co authored by J. Esparza. The paper was jointly written, with the current author designing the presented algorithms, implementing the unfsmodels prototype tool, and performing the experiments. J. Esparza contributed to simplifying the theory behind the used approach, as well as coming up ....
....J. Esparza. The paper was jointly written, with the current author designing the presented algorithms, implementing the unfsmodels prototype tool, and performing the experiments. J. Esparza contributed to simplifying the theory behind the used approach, as well as coming up with simpler proofs in [22]. The publication [P6] is co authored by I. Niemel. The basic translation was jointly developed. The current author s contribution is a new succinct LTL translation, implementation of the translations, and the experimental work. 1 INTRODUCTION It is a widely recognized fact that the complexity ....
[Article contains additional citation context not shown here]
J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001.
Combining Symbolic and Partial Order Methods for Model Checking.. - Heljanko (2002) (3 citations) Self-citation (Heljanko) (Correct)
No context found.
J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. In Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'2001.
Net Reductions for LTL Model-Checking - Esparza, Schröter Self-citation (Esparza) (Correct)
....programming techniques which are based on well known Petri net techniques like invariants and implicit places, and (2) local net reductions. We show that the conditions for the application of some local net reductions can be weakened if one is interested in LTL model checking using the approach of [EH00,EH01]. Finally, we present a number of experimental results and show that the model checking time of a net system can be significantly decreased if it has been preprocessed with our reduction techniques. 1 Introduction In two recent papers [EH00,EH01] Esparza and Heljanko have developed an unfolding ....
....in LTL model checking using the approach of [EH00,EH01] Finally, we present a number of experimental results and show that the model checking time of a net system can be significantly decreased if it has been preprocessed with our reduction techniques. 1 Introduction In two recent papers [EH00,EH01], Esparza and Heljanko have developed an unfolding technique to the problem of model checking LTL for concurrent systems. Using the automata theoretic approach, the model checking problem is reduced to two simpler problems concerning the infinite executions of a combined system obtained from the ....
[Article contains additional citation context not shown here]
J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. Accepted paper for SPIN'01, 2001.
LTL Model Checking for Modular Petri Nets - Latvala, Mäkelä (2004) (Correct)
No context found.
Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: SPIN 2001. Volume 2057 of LNCS., Springer (2001) 37--56
Efficient Model Checking of Safety Properties - Latvala (2003) (1 citation) (Correct)
No context found.
Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: SPIN 2001. Volume 2057 of LNCS., Springer (2001) 37--56
Efficient Model Checking of Safety Properties - Latvala (2003) (1 citation) (Correct)
No context found.
Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: SPIN 2001. Volume 2057 of LNCS., Springer (2001) 37--56
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC