Modeling and verification of cryptographic protocols using coloured petri nets and design/cpn, Nordic J. of Computing, vol.12, issue.3, pp.201-228, 2005. ,
Formal Modeling and Evaluation of Service-Based Business Process Elasticity in the Cloud, Proc. of the 22nd IEEE International Conference on Collaboration Technologies and Infrastructure, p.page, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00867490
An adaptive performance modeling tool for gpu architectures, PPoPP, pp.105-114, 2010. ,
Must program verification systems and calculi be verified, Proceedings, 3rd International Verification Workshop (VERIFY), Workshop at Federated Logic Conferences (FLoC), pp.34-41, 2006. ,
Cython: The Best of Both Worlds, Computing in Science & Engineering, vol.13, issue.2, pp.31-39, 2011. ,
DOI : 10.1109/MCSE.2010.118
Transformations et analyse de réseaux de Petri : Application aux protocoles, 1983. ,
Checking properties of nets using transformations, Advances in Petri Nets 1985, pp.19-40, 1986. ,
DOI : 10.1007/BFb0016204
Modular SMT Proofs for Fast Reflexive Checking Inside Coq, Certified Programs and Proofs, pp.151-166, 2011. ,
DOI : 10.1016/j.jal.2007.07.003
URL : https://hal.archives-ouvertes.fr/hal-00646960
The box calculus: A new causal algebra with multi-label communication, Lecture Notes in Computer Science, vol.609, pp.21-69, 1992. ,
DOI : 10.1007/3-540-55610-9_167
Petri net algebra, 2001. ,
DOI : 10.1007/978-3-662-04457-5
The Box Algebra=Petri Nets+Process Expressions, Information and Computation, vol.178, issue.1, pp.44-100, 2002. ,
DOI : 10.1016/S0890-5401(02)93117-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.5447
A class of composable high level Petri nets, Lecture Notes in Computer Science, vol.935, pp.103-120, 1995. ,
DOI : 10.1007/3-540-60029-9_36
Symmetric Spin, SPIN Model Checking and Software Verification, pp.1-19 ,
DOI : 10.1007/10722468_1
Symmetric Spin, International Journal on Software Tools for Technology Transfer, vol.4, issue.1, pp.92-106, 2002. ,
DOI : 10.1007/10722468_1
A Heuristic for Symmetry Reductions with Scalarsets, FME 2001 : Formal Methods for Increasing Software Productivity, pp.518-533, 2001. ,
DOI : 10.1007/3-540-45251-6_30
Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language), Sixth International Conference on Application of Concurrency to System Design (ACSD'06), 2006. ,
DOI : 10.1109/ACSD.2006.12
URL : https://hal.archives-ouvertes.fr/hal-00340477
Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions, issue.8, pp.35677-691, 1986. ,
Sigma decision diagrams, Premiliminary proceedings of the 5th International Workshop on Computing with Terms and Graphs, number TR-09-05, pp.18-32, 2009. ,
Box Calculus with Coloured Buffers Symbolic model checking : 1020 states and beyond, LACL. 9. Références [33] Logic in Computer Science LICS '90, Proceedings., Fifth Annual IEEE Symposium on e, pp.428-439, 1990. ,
Formal Modelling and Analysis of Behaviour Grading within a peer-to-peer Storage System, The 2012 Symposium On Theory of Modeling and Simulation ,
URL : https://hal.archives-ouvertes.fr/hal-00868709
Formal verification of a partial-order reduction technique for model checking, Journal of Automated Reasoning, vol.23, issue.3, pp.265-298, 1999. ,
DOI : 10.1007/3-540-61042-1_48
A Sweep-Line Method for State Space Exploration, Tools and Algorithms for the Construction and Analysis of Systems, pp.450-464, 2001. ,
DOI : 10.1007/3-540-45319-9_31
Model checking, Communications of the ACM, vol.52, issue.11, 2007. ,
DOI : 10.1145/1592761.1592781
Efficient generation of counterexamples and witnesses in symbolic model checking, Proceedings of the 32nd ACM/IEEE conference on Design automation conference , DAC '95, pp.427-432, 1995. ,
DOI : 10.1145/217474.217565
Exploiting symmetry in temporal logic model checking, Formal Methods in System Design, vol.9, issue.12, pp.77-104, 1996. ,
Symmetry reductions in model checking, Computer Aided Verification, pp.147-158, 1998. ,
DOI : 10.1007/BFb0028741
The Vehicle Relocation Problem in Car Sharing Systems: Modeling and Simulation in a Petri Net Framework, Application and Theory of Petri Nets and Concurrency, pp.250-269 ,
DOI : 10.1007/978-3-642-38697-8_14
On software implementation of petri nets and colored petri nets using high-level concurrent languages, Seventh European Workshop on Application and Theory of Petri Nets, pp.207-241, 19861986. ,
The Coq proof assistant ,
URL : https://hal.archives-ouvertes.fr/inria-00069919
On-the-fly emptiness checks for generalized Büchi automata, Proceedings of the 12th International SPIN Workshop on Model Checking of Software (SPIN'05), pp.143-158, 2005. ,
Data Decision Diagrams for Petri Net Analysis, Proceedings of the 23th International Conference on Application and Theory of Petri Nets, pp.101-120, 2002. ,
DOI : 10.1007/3-540-48068-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.7533
Construction of S-invariants and S-components for refined Petri boxes, Lecture Notes in Computer Science, vol.691, pp.242-261, 1993. ,
DOI : 10.1007/3-540-56863-8_50
S-invariant analysis of general recursive Petri boxes, Acta Informatica, vol.32, issue.4, pp.313-345, 1995. ,
DOI : 10.1007/s002360050018
Asynchronous box calculus, Fundamenta Informaticae, vol.54, issue.4, pp.295-344, 2003. ,
General refinement for high level petri nets, Foundations of Software Technology and Theoretical Computer Science, pp.297-311, 1997. ,
DOI : 10.1007/BFb0058038
Semantics, composition and net properties of algebraic high-level nets, Lecture Notes in Computer Science, vol.524, pp.93-117, 1991. ,
DOI : 10.1007/BFb0019971
LTL translation improvements in Spot, Proceedings of the 5th International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS'11), Electronic Workshops in Computing, 2011. ,
SPOT: an extensible model checking library using transition-based generalized buchi automata, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings., pp.76-83, 2004. ,
DOI : 10.1109/MASCOT.2004.1348184
URL : https://hal.archives-ouvertes.fr/hal-01496158
Symmetry and model checking. Formal methods in system design, pp.105-131, 1996. ,
From asymmetry to full symmetry : New techniques for symmetry reduction in model checking, Correct Hardware Design and Verification Methods, pp.142-157, 1999. ,
Méthodes et outils de vérification pour les réseaux de Petri de haut niveau, CNAM, 2006. ,
An efficient algorithm for the enabling test of colored Petri nets, CPN'04, number 570 in DAIMI report PB. University ofÅrhusofÅrhus, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01124934
High Level Petri Nets Analysis with Helena, Applications and Theory of Petri Nets 2005, pp.455-464, 2005. ,
DOI : 10.1007/11494744_26
URL : https://hal.archives-ouvertes.fr/hal-00149528
Méthodes et outils de vérification pour les réseaux de Petri de haut nive, CNAM, 2006. ,
Syntactical Colored Petri Nets Reductions, Automated Technology for Verification and Analysis, pp.202-216, 2005. ,
DOI : 10.1007/11562948_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.6477
New coloured reductions for software validation, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01124921
Memory Efficient State Space Storage in Explicit Software Model Checking, Model Checking Software, pp.43-57, 2005. ,
DOI : 10.1007/11537328_7
URL : https://hal.archives-ouvertes.fr/hal-01125050
On the Computation of Stubborn Sets of Colored Petri Nets, Petri Nets and Other Models of Concurrency-ICATPN 2006, pp.146-165, 2006. ,
DOI : 10.1007/11767589_9
URL : https://hal.archives-ouvertes.fr/hal-00145906
The Unix Philosophy, 1995. ,
DOI : 10.1016/B978-155558273-9/50003-8
A BSP Algorithm for the State Space Construction of Security Protocols, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology, 2010. ,
DOI : 10.1109/PDMC-HiBi.2010.14
URL : https://hal.archives-ouvertes.fr/hal-00669177
A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols, 2012 11th International Symposium on Parallel and Distributed Computing, pp.11-18 ,
DOI : 10.1109/ISPDC.2012.10
URL : https://hal.archives-ouvertes.fr/hal-00868689
A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols, 2012 11th International Symposium on Parallel and Distributed Computing, pp.11-18, 2012. ,
DOI : 10.1109/ISPDC.2012.10
URL : https://hal.archives-ouvertes.fr/hal-00868689
Runtime Efficient State Compaction in Spin, Theoretical and Practical Aspects of SPIN Model Checking, pp.12-21, 1999. ,
DOI : 10.1007/3-540-48234-2_2
S-invariance in predicate/transition nets Simple on-the-fly automatic verification of linear temporal logic, European Workshop on Applications and Theory of Petri Nets Proceedings of the Fifteenth IFIP WG6. 1 International Symposium on Protocol Specification , Testing and Verification. IFIP, 1982. ,
Using partial orders to improve automatic verification methods, Computer-Aided Verification, pp.176-185, 1991. ,
DOI : 10.1007/BFb0023731
State-space caching revisited. Formal Methods in System Design, pp.227-241, 1995. ,
DOI : 10.1007/bf01384077
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3630
Partial-order methods for the verification of concurrent systems : an approach to the state-explosion problem, volume 1032, 1996. ,
DOI : 10.1007/3-540-60761-7
Using partial orders for the efficient verification of deadlock freedom and safety properties, Computer Aided Verification, pp.332-342, 1992. ,
On the implementation of concurrent calculi in net calculi: two case studies, Theoretical Computer Science, vol.141, issue.1-2, 1995. ,
DOI : 10.1016/0304-3975(94)00073-R
Proving Equalities in a Commutative Ring Done Right in Coq, Theorem Proving in Higher Order Logics, pp.98-113, 2005. ,
DOI : 10.1007/11541868_7
State space compression in spin with getss, Proc. Second SPIN Workshop, 1996. ,
Efficient reductions for ltl formulae verification, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01124907
A reduction theory for coloured nets, High-level Petri Nets, pp.399-425, 1991. ,
Hierarchical Set Decision Diagrams and Automatic Saturation, Proceedings of the 29th international conference on Applications and Theory of Petri Nets, PETRI NETS '08, pp.211-230, 2008. ,
DOI : 10.1007/978-3-540-68746-7_16
URL : https://hal.archives-ouvertes.fr/hal-01303835
Truly On-the-Fly LTL Model Checking, Tools and Algorithms for the Construction and Analysis of Systems, pp.191-205, 2005. ,
DOI : 10.1007/978-3-540-31980-1_13
URL : https://hal.archives-ouvertes.fr/inria-00000753
A primer on the Petri Net Markup Language and ISO/IEC 15909-2, 10th International workshop on Practical Use of Colored Petri Nets and the CPN Tools, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01126017
Communicating sequential processes Ramin Hojati, RobertK. Brayton, and RobertP. Kurshan. Bdd-based debugging of designs using language containment and fair ctl, Computer Aided Verification, pp.666-677, 1978. ,
Tracing protocols, AT&T technical journal, vol.64, issue.12, pp.2413-2434, 1985. ,
An improved protocol reachability analysis technique . Software : Practice and Experience, pp.137-161, 1988. ,
Algorithms for automated protocol validation, AT&T technical journal, vol.69, issue.1, pp.32-44, 1990. ,
The model checker spin. Software Engineering, IEEE Transactions on, vol.23, issue.5, pp.279-295, 1997. ,
State compression in spin : Recursive indexing and compression training runs, Proceedings of Third International SPIN Workshop, 1997. ,
An analysis of bitstate hashing. Formal methods in system design, pp.289-307, 1998. ,
On checking model checkers, Computer Aided Verification, pp.61-70, 1998. ,
An improvement in formal verification, pp.197-211, 1994. ,
Doron Peled, and Mihalis Yannakakis. On nested depth first search, Proc. Second SPIN Workshop, pp.81-89, 1996. ,
A minimized automaton representation of reachable states, International Journal on Software Tools for Technology Transfer, vol.2, issue.3, pp.270-278, 1999. ,
Hierarchies in coloured petri nets, High-level Petri Nets, pp.215-243, 1991. ,
Reachability trees for high-level petri nets, Theoretical Computer Science, vol.45, issue.0, pp.261-292, 1986. ,
DOI : 10.1016/0304-3975(86)90046-0
URL : http://dx.doi.org/10.1016/0304-3975(86)90046-0
Towards reachability trees for high-level petri nets, Lecture Notes in Computer Science, vol.188, pp.215-233, 1984. ,
DOI : 10.1007/3-540-15204-0_13
Exploiting heap symmetries in explicit-state model checking of software, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), pp.254-261, 2001. ,
DOI : 10.1109/ASE.2001.989811
Symmetry reductions for model checking of concurrent dynamic software, International Journal on Software Tools for Technology Transfer, vol.20, issue.4, pp.302-319, 2004. ,
DOI : 10.1007/s10009-004-0154-9
URL : https://hal.archives-ouvertes.fr/hal-01418878
Bounded-memory algorithms for verification on-the-fly, Computer Aided Verification, pp.192-202, 1992. ,
DOI : 10.1007/3-540-55179-4_19
URL : https://hal.archives-ouvertes.fr/inria-00075100
Coloured Petri Nets and the Invariant-Method, DAIMI Report Series, vol.8, issue.104, 1981. ,
DOI : 10.7146/dpb.v8i104.6519
Coloured Petri nets : basic concepts, analysis methods, and practical use, EATCS monographs on theoretical computer science, 1992. ,
Coloured Petri Nets : Modelling and Validation of Concurrent Systems, 2009. ,
An Introduction to the Theoretical Aspects of Coloured Petri Nets, DAIMI Report Series, vol.13, issue.476, 1994. ,
DOI : 10.7146/dpb.v13i476.6949
Condensed state spaces for symmetrical Coloured Petri Nets, Formal Methods in System Design, vol.3, issue.1-2, pp.7-40, 1996. ,
DOI : 10.1007/BF00625967
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems, International Journal on Software Tools for Technology Transfer, vol.2, issue.2, pp.3-4213, 2007. ,
DOI : 10.1007/s10009-007-0038-x
Computer aided verification of lamport's fast mutual exclusion algorithm using colored petri nets and occurrence graphs with symmetries. Parallel and Distributed Systems, IEEE Transactions on, vol.10, issue.7, pp.714-732, 1999. ,
On the symmetry reduction method for Petri Nets and similar formalisms, 2003. ,
New canonical representative marking algorithms for place/transition-nets Application and Theory of Petri Nets, Lecture Notes in Computer Science, pp.258-277, 2004. ,
Eliminating Concurrency Bugs with Control Engineering, Computer, vol.42, issue.12, pp.52-60, 2009. ,
DOI : 10.1109/MC.2009.391
A parallel algorithm for constructing binary decision diagrams, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp.220-223, 1990. ,
DOI : 10.1109/ICCD.1990.130209
Flexibility in Algebraic Nets, 1998. ,
DOI : 10.1007/3-540-69108-1_19
Algebraic nets with flexible arcs, Theoretical Computer Science, vol.262, issue.1-2, pp.285-310, 2001. ,
DOI : 10.1016/S0304-3975(00)00205-X
URL : http://doi.org/10.1016/s0304-3975(00)00205-x
Towards Efficient Verification of Systems with Dynamic Process Creation, Lecture Notes in Computer Science, vol.5160, pp.186-200, 2008. ,
DOI : 10.1007/978-3-540-85762-4_13
URL : https://hal.archives-ouvertes.fr/hal-00666665
An approach to state space reduction for systems with dynamic process creation, 2009 24th International Symposium on Computer and Information Sciences, pp.543-548, 2009. ,
DOI : 10.1109/ISCIS.2009.5291864
URL : https://hal.archives-ouvertes.fr/hal-00666664
State space reduction for dynamic process creation, Scientific Annals of Computer Science, vol.20, 2010. ,
DOI : 10.1109/iscis.2009.5291864
URL : https://hal.archives-ouvertes.fr/hal-00666663
Finding Stubborn Sets of Coloured Petri Nets without Unfolding, Lecture Notes in Computer Science, vol.1420, pp.104-123, 1998. ,
DOI : 10.1007/3-540-69108-1_7
Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets, Lecture Notes in Computer Science, vol.7927, pp.21-28, 2013. ,
DOI : 10.1007/978-3-642-38697-8_2
LLVM language reference manual ,
The LLVM compiler infrastructure ,
DOI : 10.1007/11532378_2
LLVM related publications ,
On the advantage of free choice : A symmetric and fully distributed solution to the dining philosophers problem (extended abstract), Proc. 8th Annual ACM Symposium on Principles of Programming Languages (POPL'81), pp.133-138, 1981. ,
Counterexample-preserving reduction for symbolic model checking. CoRR, abs/1301, 2013. ,
Python bindings for LLVM ,
Applying compiler techniques to reachability analysis of high-level models, Workshop on Concurrency, Specification & Programming, pp.129-142, 2000. ,
Condensed storage of multi-set sequences. Practical Use of High-Level Petri Nets, DAIMI report PB-547, pp.111-125, 2000. ,
A Study of the Recoverability of Computer Systems, 1974. ,
Communication and concurrency, 1989. ,
On the Integration of Delay and Throughput Measures in Distributed Processing Models, Report, 1981. ,
Combining ccs and petri nets via structural axioms, Fundam. Inf, vol.202, issue.13, pp.193-229, 1994. ,
Maria: Modular Reachability Analyser for Algebraic System Nets, Lecture Notes in Computer Science, vol.2360, pp.434-444, 2002. ,
DOI : 10.1007/3-540-48068-4_25
Certifying model checkers, Computer Aided Verification, pp.2-13, 2001. ,
Counter-example generation in symbolic abstract model-checking, International Journal on Software Tools for Technology Transfer, vol.79, issue.2-3, pp.158-164, 2004. ,
DOI : 10.1109/5.97300
URL : https://hal.archives-ouvertes.fr/hal-00199168
Helena : a high level net analyzer ,
Helena : a high level net analyzer ,
The Isabelle proof assistant ,
All from one, one for all: on model checking using representatives, Computer Aided Verification, pp.409-423, 1993. ,
DOI : 10.1007/3-540-56922-7_34
Combining partial order reductions with on-the-fly modelchecking . Formal Methods in System Design, pp.39-64, 1996. ,
A Petri Net Interpretation of Open Reconfigurable Systems, Fundamenta Informaticae, vol.20, pp.1-33, 2012. ,
DOI : 10.1007/11419822_1
URL : https://hal.archives-ouvertes.fr/hal-00628489
Communication with automata (Kommunikation mit Automaten), 1962. ,
The temporal logic of programs Automated verification of asynchronous circuits using circuit petri nets, 18th Annual Symposium on Asynchronous Circuits and Systems ASYNC '08. 14th IEEE International Symposium on, pp.46-57, 1977. ,
Algebras of coloured Petri nets, 2010. ,
Quickly prototyping Petri nets tools with SNAKES. Petri net newsletter, 2008. ,
DOI : 10.4108/icst.simutools2008.3007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.9790
On time petri nets, Elektronische Informationsverarbeitung und Kybernetik, vol.27, issue.4, pp.227-244, 1991. ,
Analysis of asynchronous concurrent systems by timed petri nets, 1973. ,
Haskell-Coloured Petri Nets, IFL'99, 1999. ,
DOI : 10.1007/10722298_10
How to calculate symmetries of Petri nets, Acta Informatica, vol.36, issue.7, pp.545-590, 2000. ,
DOI : 10.1007/s002360050002
Integrating low level symmetries into reachability analysis In Tools and Algorithms for the Construction and Analysis of Systems, pp.315-330, 2000. ,
Performance evaluation of systems using nets, Net Theory and Applications Lecture Notes in Computer Science, vol.84, pp.307-319, 1980. ,
DOI : 10.1007/3-540-10001-6_30
Error detection by reduced reachability graph generation, Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp.95-112, 1988. ,
Stubborn sets for reduced state space generation, Advances in Petri Nets 1990, pp.491-515, 1991. ,
DOI : 10.1007/3-540-53863-1_36
A stubborn attack on state explosion. Formal Methods in System Design, pp.297-322, 1992. ,
State of the art report : Stubborn sets, Petri Net Newsletter, vol.46, pp.6-14, 1994. ,
Petri net models for algebraic theories of concurrency, PARLE Parallel Architectures and Languages Europe, pp.224-242, 1987. ,
DOI : 10.1007/3-540-17945-3_13
Parallel systems specifications with coloured Petri nets and algebraic specifications, ASIAN'00, pp.293-308, 1961. ,
DOI : 10.1007/3-540-18086-9_31
Memory efficient state storage in spin, Proceedings of the 2nd SPIN Workshop, 1996. ,
Efficient implementation of prioritized transitions for high-level Petri nets, Petri Nets and Software Engineering. International Workshop PNSE'11 of CEUR Workshop Proceedings, pp.27-41, 2011. ,
Partial-order methods for temporal verification, CONCUR'93, pp.233-246, 1993. ,
DOI : 10.1007/3-540-57208-2_17
Reliable hashing without collision detection, Computer Aided Verification, pp.59-70, 1993. ,
DOI : 10.1007/3-540-56922-7_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3755