Result 1 to 20 of 122 total
Ten years of saturation: A Petri net perspective. (English)
Jensen, Kurt (ed.) et al., Transactions on Petri nets and other models of concurrency V. Berlin: Springer (ISBN 978-3-642-29071-8/pbk). Lecture Notes in Computer Science 6900. Journal Subline, 51-95 (2012).
1
Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding. (English)
Perform. Eval. 68, No. 5, 463-486 (2011).
2
Modelling and analysis of UPnP AV media player system based on Petri nets. (English)
Int. J. Syst. Sci. 42, No. 9, 1573-1580 (2011).
3
Symbolic verification and test generation for a network of communicating FSMs. (English)
Bultan, Tevfik (ed.) et al., Automated technology for verification and analysis. 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24371-4/pbk). Lecture Notes in Computer Science 6996, 432-442 (2011).
4
A fully symbolic bisimulation algorithm. (English)
Delzanno, Giorgio (ed.) et al., Reachability problems. 5th international workshop, RP 2011, Genoa, Italy, September 28‒30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24287-8/pbk). Lecture Notes in Computer Science 6945, 218-230 (2011).
5
Speculative image computation for distributed symbolic reachability analysis. (English)
J. Log. Comput. 21, No. 1, 63-83 (2011).
6
Symbolic verification and test generation for a network of communicating fsms (English)
ATVA, 432-442 (2011).
7
A fully symbolic bisimulation algorithm (English)
RP, 218-230 (2011).
8
A symbolic algorithm for shortest EG witness generation (English)
TASE, 68-75 (2011).
9
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems. (English)
Int. J. Softw. Tools Technol. Transf. 11, No. 2, 117-131 (2009).
10
Parallel symbolic state-space exploration is difficult, but what is the alternative? (English)
Comput. Res. Repos. 2009, Article No. 0912.2785 (2009).
11
Symbolic CTL model checking of asynchronous systems using constrained saturation. (English)
Liu, Zhiming (ed.) et al., Automated technology for verification and analysis. 7th international symposium, ATVA 2009, Macao, China, October 14‒16, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04760-2/pbk). Lecture Notes in Computer Science 5799, 368-381 (2009).
12
P-semiflow computation with decision diagrams. (English)
Franceschinis, Giuliana (ed.) et al., Applications and theory of Petri nets. 30th international conference, PETRI NETS 2009, Paris, France, June 22‒26, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02423-8/pbk). Lecture Notes in Computer Science 5606, 143-162 (2009).
13
Symbolic reachability analysis of integer timed Petri nets. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 595-608 (2009).
14
Symbolic state-space generation of asynchronous systems using extensible decision diagrams. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 582-594 (2009).
15
P-semiflow computation with decision diagrams (English)
Petri Nets, 143-162 (2009).
16
Symbolic CTL model checking of asynchronous systems using constrained saturation (English)
ATVA, 368-381 (2009).
17
Petri net analysis using decision diagrams (English)
QEST, 7 (2009).
18
Symbolic reachability analysis of integer timed Petri nets (English)
SOFSEM, 595-608 (2009).
19
Symbolic state-space generation of asynchronous systems using extensible decision diagrams (English)
SOFSEM, 582-594 (2009).
20
Result 1 to 20 of 122 total
Start
Contact
Print
General Help
