Merged processes: A new condensed representation of Petri net behaviour

Acta Informatica

Volumn 43, Issue 5, 2006, Pages 307-330

  Khomenko, Victor ^a   Kondratyev, Alex ^b   Koutny, MacIej ^a   Vogler, Walter ^c  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b CADENCE DESIGN SYSTEMS   (United States)

^c UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONDENSED REPRESENTATIONS; MERGED PROCESS; PETRI NET UNFOLDINGS; STATE-SPACE EXPLOSION; UNFOLDINGS;

MODEL CHECKING;

PETRI NETS;

EID: 33750740161     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-006-0023-y     Document Type: Article

References (20)

1. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)
2. Corbett, J.C.: Evaluating Deadlock detection methods for concurrent software IEEE Trans. Softw. Eng. 22, 161-180 (1996)
3. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science 40, Cambridge University Press, Cambridge (1995)
4. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Proceedings of SAT'03, LNCS 2919, 502-518 (2003)
5. Engelfriet, J.: Branching processes of Petri nets. Acta. Inf. 28, 575-591 (1991)
6. Esparza, J.: Decidability and Complexity of Petri Net Problems - an Introduction In: Lectures on Petri nets I: basic models, LNCS 1491, pp. 374-428 (1998)
7. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan's unfolding algorithm Formula Methods Syst. Des. 20, 285-310 (2002)
8. Harel, D., Lachover, H., Naamad, A., Pnueli, A., et al.: STATEMATE: a working environment for the development of complex reactive systems IEEE Trans. Soft. Eng. 16, 403-414 (1990)
9. Heljanko, K.: Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-Safe Petri Nets. Fundam. Inf. 37, 247-268 (1999)
10. Kahn, G.: The Semantics of a Simple Language for Parallel Programming. In: Proceedings of IFIP Congress, North Holland, pp. 471-475 (1974)
11. Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings PhD Thesis, School of Computing Science, University of Newcastle (2003)
12. Khomenko, V., Kondratyev, A., Koutny, M., Vogler, V.: Merged processes - a New Condensed Representation of Petri Net Behaviour. In: Proceedings of CONCUR'05, LNCS 3653, pp. 338-352 (2005)
13. Khomenko, V., Koutny, M., Vogler, V.: Canonical prefixes of Petri net unfoldings Acta Inf. 40, 95-118 (2003)
14. Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state coding conflicts in STG unfoldings using SAT Fundam. Inf. 62, 221-241 (2004)
15. McMillan, K.L.: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. In: Proceedings of CAV'92, LNCS 663, pp. 164-174 (1992)
16. McMillan, K.L.: Symbolic Model Checking: an Approach to the State Explosion Problem PhD Thesis, CMU-CS-92-131 (1992)
17. Melzer, S., Römer, S.: Deadlock Checking Using Net Unfoldings. In: Proceedings of CAV'97, LNCS 1254, pp. 352-363 (1997)
18. Moskewicz, S., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: CHAFF: Engineering an Efficient SAT Solver. In: Proceedings of DAC'01, ASME Tech. Publ., pp. 530-535 (2001)
19. Murata, T.: Petri Nets: properties, analysis and applications Proc. of IEEE 77, 541-580 (1989)
20. Valmari, A.: The State Explosion Problem. In: Lectures on Petri nets I: basic models, LNCS 1491, pp. 429-528 (1998)