Data decision diagrams for petri net analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2360 LNCS, Issue , 2002, Pages 101-120

  Couvreur, Jean Michel ^a   Encrenaz, Emmanuelle ^b   Paviot Adet, Emmanuel ^b   Poitrenaud, Denis ^b   Wacrenier, Pierre Andre ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Decision Diagram; Petri Nets; System verification

Indexed keywords

DATA STRUCTURES; DECISION THEORY;

APPLICATION SPECIFIC; DATA DECISION; DECISION DIAGRAM; LINEAR FUNCTIONS; SHARED DATA STRUCTURE; SYSTEM VERIFICATIONS; VERIFICATION TOOLS;

PETRI NETS;

EID: 84879091336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48068-4_8     Document Type: Conference Paper

References (9)

1. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, August 1986. 101
2. G. Ciardo, G. Lüttgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Proc. of ICATPN'2000, volume 1825 of Lecture Notes in Computer Science, pages 103-122. Springer Verlag, 2000. 101, 102, 112, 120
3. J. M. Couvreur and E. Paviot-Adet. New structural invariants for Petri nets analysis. In Proc. of ICATPN'94, volume 815 of Lecture Notes in Computer Science, pages 199-218. Springer Verlag, 1994. 114
4. H. Hulgaard, P. F.Williams, and H. R. Andersen. Equivalence checking of combinational circuits using boolean expression diagrams. IEEE Transactions of Computer-Aided Design, 18(7), July 1999. 101
5. T. Kolks, B. Lin, and H. De Man. Sizing and verification of communication buffers for communicating processes. In Proc. of IEEE International Conference on Computer-Aided Design, volume 1825, pages 660-664, Santa Clara, USA, November 1993. 101
6. S. Minato, N. Ishiura, and S. Yajima. Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In L. J.M Claesen, editor, Proceedings of the 27th ACM/IEEE Design Automation Conference, DAC'90, pages 52-57, June 1990. 101
7. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. of ICATPN'99, volume 1639 of Lecture Notes in Computer Science, pages 6-25. Springer Verlag, 1999. 101, 102, 120
8. E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri net analysis using boolean manipulation. In Proc. of ICATPN'94, volume 815 of Lecture Notes in Computer Science, pages 416-435. Springer Verlag, 1994. 101
9. R. Valk. Bridging the gap between place-and floyd-invariants with applications to preemptive scheduling. In Proc. of ICATPN'93, volume 691 of Lecture Notes in Computer Science, pages 432-452. Springer Verlag, 1993. 111, 116