New Canonical Representative Marking Algorithms for Place/Transition-Nets-Reference-Cited by-同舟云学术

New Canonical Representative Marking Algorithms for Place/Transition-Nets

Published:2004 Issue: Volume: Page:258-277
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Junttila Tommi A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-27793-4_15.pdf

Reference26 articles.

1. Starke, P.H.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation 8, 293–303 (1991)

2. Schmidt, K.: How to calculate symmetries of Petri nets. Acta Informatica 36, 545–590 (2000)

3. Lecture Notes in Computer Science;K. Schmidt,2000

4. Junttila, T.A.: Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science 7, 307–326 (2001)

5. Junttila, T.: On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science, Doctoral dissertation (2003)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Specification, construction, and exact reduction of state transition system models of biochemical processes;The Journal of Chemical Physics;2012-10-17

2. Analysis of the Petri net model of parallel manufacturing processes with shared resources;Information Sciences;2011-12

3. Modelling with History-Dependent Petri Nets;Lecture Notes in Computer Science;2007

4. State Space Exploration of Object-Based Systems Using Equivalence Reduction and the Sweepline Method;Automated Technology for Verification and Analysis;2005

5. A Symbolic Symbolic State Space Representation;Lecture Notes in Computer Science;2004