Abstract
McMillan’s unfolding approach to the reachability problem in 1-safe Petri nets and its later improvements by Esparza-Römer-Vogler have proven in practice as a very effective method to avoid state-explosion. This method computes a complete finite prefix of the infinite branching process of a net. On the other hand,the Local First Search approach (LFS) was recently introduced as a new partial order reduction technique which characterizes a restricted subset of configurations that need to be explored to check local properties. In this paper we amalgamate the two approaches: We combine the reduction criterion of LFS with the notions of an adequate order and cutoff events essential to the unfolding approach. As a result,our new LFS method computes a reduced transition system without the problem of state duplication (present in the original LFS). Since it works for any transition system with an independence relation,this black box partial unfolding remains more general than the unfolding of Petri nets. Experiments show that the combination gives improved reductions compared to the original LFS.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bednarczyk, Categories of asynchronous systems, Ph.D. thesis, Computer Science, University of Sussex, Brighton, 1987.
V. Diekert and G. Rozenberg (eds.), The book of traces, World Scientific, 1995.
J. Engelfriet, Branching processes of Petri nets, Acta Informatica 28 (1991), no. 6, pp. 575–591.
J. Esparza and S. Römer, An unfolding algorithm for synchronous products of transition systems, International Conference on Concurrency Theory (CONCUR), LNCS 1664, 1999, invited paper, pp. 2–20.
J. Esparza, S. Römer,and W. Vogler, An improvement of McMillan’s unfolding algorithm, TACAS, LNCS 1055, 1996, pp. 87–106.
P. Godefroid, Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, LNCS 1032, Springer-Verlag, 1996.
G.J. Holzmann, The engineering of a model checker: the Gnu i-protocol case study revisited, Proc. of the 6th Spin Workshop, LNCS, no. 1680, 1999.
V. Khomenko and M. Koutny, Towards an efficient algorithm for unfolding Petri nets, International Conference on Concurrency Theory (CONCUR), LNCS 2154, 2001, pp. 366–381.
D. Lugiez, P. Niebert and S. Zennou, Dynamic bounds and transition merging for local first search, SPIN Workshop 2002, LNCS, 2002.
K.L. McMillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Computer Aided Verification (CAV), 1992, pp. 164–174.
P. Niebert, M. Huhn, S. Zennou, and D. Lugiez, Local first search—a new paradigm in partial order reductions, International Conference on Concurrency Theory (CONCUR), LNCS 2154, 2001, pp. 396–410.
M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science 13 (1981), no. 1, 85–108.
M. Nielsen and G. Winskel, Models for concurrency, Handbook of Logic and the Foundations of Computer Science (S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, eds.), vol. IV, Oxford Science Publications, Clarendon Press, 1995.
D. Peled, All from one, one for all:On model checking using representatives, International Conference on Computer Aided Verification (CAV), LNCS,vol. 697, 1993, pp. 409–423.
M. W. Shields, Concurrent machines, The Computer Journal 28 (1985), no. 5, 449–465.
A.N. Strahler, Hypsometric (area-altitude) analysis of erosonal topology, Bull. Geol. Soc. of America 63 (1952), 1117–1142.
A. Valmari, Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets, vol. 2, 1989, pp. 1–22.
Wi. Zielonka, Notes on finite asynchronous automata, R.A.I.R.O.—Informatique Théoretique et Applications 21 (1987), 99–135.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bornot, S., Morin, R., Niebert, P., Zennou, S. (2002). Black Box Unfolding with Local First Search. In: Katoen, JP., Stevens, P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46002-0_27
Download citation
DOI: https://doi.org/10.1007/3-540-46002-0_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43419-1
Online ISBN: 978-3-540-46002-2
eBook Packages: Springer Book Archive