Modular construction of finite and complete prefixes of petri net unfoldings

Fundamenta Informaticae

Volumn 95, Issue 1, 2009, Pages 219-244

  Madalinski , Agnes ^a   Fabre, Eric ^b  

^a UNIVERSIDAD AUSTRAL DE CHILE   (Chile)

^b INRIA   (France)

Author keywords

Category theory; Distributed system; Finite complete prefix; Modular computation; Petri net; Pullback; Unfolding

Indexed keywords

CATEGORY THEORY; COMPACT REPRESENTATION; COMPONENT BEHAVIOUR; DISTRIBUTED SYSTEM; DISTRIBUTED SYSTEMS; GLOBAL SYSTEMS; MESSAGE PASSING ALGORITHM; PETRI NET UNFOLDINGS; UNFOLDINGS;

MESSAGE PASSING; MODULAR CONSTRUCTION; PETRI NETS;

GRAPH THEORY;

EID: 77049113867     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2009-148     Document Type: Article

References (20)

1. Baldan, P., Haar, S., König, B.: Distributed Unfolding of Petrinets, FoSSaCS'06, LNCS 3921, pp. 126-141, 2006.
2. Couvreur, J.-M., Grivet, S., Poitrenaud, D.: Unfolding of Products of Symmetrical Petrinets, Lecture Notes in Computer Science, 2075, 2001, pp. 121-143.
3. Engelfriet, J.: Branching Processes of Petrinets., Acta Informatica, 28, 1991, pp. 575-591, NewsletterInfo: 38, 40.
4. Esparza, J., Heljanko, K.: Unfoldings: a Partial-Order Approach to Model Checking, EATCS monographs on Theoretical Computer Science, Springer-Verlag, 2008.
5. Esparza, J., Römer, S.: An Unfolding Algorithm for Synchronous Products of Transition Systems, International Conference on Concurrency Theory, LNCS 1664, pp. 2-20, 1999.
6. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan's Unfolding Algorithm, Formal methods in systems design, 2002.
7. Fabre, E.: Factorization of Unfoldings for Distributed Tile Systems, Part 1 : Reduced Interaction Case, Technical Report 1529, IRISA, April 2003.
8. Fabre, E.: Factorization of Unfoldings for Distributed Tile Systems, Part 2 : General Case, Technical Report 1606, IRISA, May 2004.
9. Fabre, E.: Distributed Diagnosis based on Trellis Processes, 44th Conf. on Decision and Control (CDC), Seville, Spain, December 2005.
10. Fabre, E.: On the Construction of Pullbacks for Safe Petrinets, Applications and Theory of Petrinets and other Models of Concurrency, ATPN'06, Turku, Finland, June 2006.
11. Fabre, E.: Bayesian Networks of Dynamic Systems, Habilitation Thesis, available at http://www.irisa.fr/distribcom/Personal Pages/fabre/Papiers/hdr. pdf, June 2007.
12. Fabre, E., Benveniste, A., Haar, S., Jard, C.: Distributed Monitoring of Concurrent and Asynchronous Systems, Journal of Discrete Event Systems, special issue, May 2005, pp. 33-84.
13. Khomenko, V.: Model Checking Based on Petri Net Unfolding Prefixes, Ph.D. Thesis, University of Newcastle upon Tyne, 2002.
14. Khomenko, V., Koutny, M., Vogler, W.: Canonical Prefixes of Petri Net Unfoldings, Acta Informatica, Volume 40, Number 2, October 2003, pp. 95-118.
15. McMillan, K. L.: Symbolic Model Checking: an approach to the state explosion problem, Ph.D. Thesis, 1992.
16. McMillan, K. L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. International Workshop on Computer Aided Verification, July 1992.
17. Nielsen, M., Plotkin, G., Winskel, G.: Petrinets, Event Structures and Domains, Part I, Theor. Computer Science, 13(1), January 1980, pp. 85-108.
18. Winskel, G.: A New Definition of Morphism on Petrinets, STACS '84: Proceedings of the Symposium of Theoretical Aspects of Computer Science, Springer-Verlag, London, UK, 1984, ISBN 3-540-12920-0.
19. Winskel, G.: Categories of Models for Concurrency, Seminar on Concurrency, Carnegie-Mellon University, Springer-Verlag, London, UK, 1985, ISBN 3-540-15670-4.
20. Winskel, G.: Petrinets, Algebras, Morphisms, and Compositionality, Information and Computation, 72, 1987, pp. 197-238