Partial model checking, Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science LICS, pp.398-407, 1995. ,
Selective mu-calculus and formula-based equivalence of transition systems, Journal of Computer and System Sciences, vol.59, pp.537-556, 1999. ,
A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces, Software Tools for Technology Transfer, vol.7, issue.1, pp.74-86, 2005. ,
Distributed State Space Minimization, Software Tools for Technology Transfer, vol.7, issue.3, pp.280-291, 2005. ,
Distributed branching bisimulation minimization by inductive signatures, Proceedings of the 8th International Workshop on Parallel and Distributed Methods in verifiCation PDMC 2009 ,
, Electronic Proceedings in Theoretical Computer Science, vol.14, 2009.
Grid'5000: A large scale and highly reconfigurable experimental grid testbed, IJHPCA, vol.20, issue.4, pp.481-494, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00684943
Safety for branching time semantics, Proceedings of 18th ICALP, 1991. ,
A Theory of Communicating Sequential Processes, J. ACM, vol.31, issue.3, pp.560-599, 1984. ,
Reference Manual of the LNT to LOTOS Translator (Version, INRIA, vol.6, issue.7, 2017. ,
Enhancing Compositional Reachability Analysis with Context Constraints, Proceedings of the 1st ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp.115-125, 1993. ,
Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986. ,
Smart Reduction, Proceedings of Fundamental Approaches to Software Engineering (FASE'11), vol.6603, pp.111-126, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00572535
Three logics for branching bisimulation, Journal of the Association for Computing Machinery, 1990. ,
On the Fly" Verification of Behavioural Equivalences and Preorders, Proceedings of the 3rd Workshop on Computer-Aided Verification (CAV'91), vol.575, pp.181-191, 1991. ,
Propositional dynamic logic of regular programs, J. Comput. Syst. Sci, vol.18, issue.2, pp.194-211, 1979. ,
Nested-Unit Petri Nets, Journal of Logical and Algebraic Methods in Programming, vol.104, pp.60-85, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02072190
SVL: a Scripting Language for Compositional Verification, Proceedings of the 21st IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'01), pp.377-392, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00072396
Compositional Verification of Asynchronous Concurrent Systems Using CADP, Acta Informatica, vol.52, issue.4, pp.337-392, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01138749
, CADP 2011: A Toolbox for the Construction and Analysis of Distributed Processes, vol.15, pp.89-107, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00715056
Branching-Time and Abstraction in Bisimulation Semantics (extended abstract). CS R8911, Centrum voor Wiskunde en Informatica, Amsterdam (1989), also in proc, IFIP 11th World Computer Congress, 1989. ,
Branching bisimilarity with explicit divergence, Fundam. Inform, vol.93, issue.4, pp.371-392, 2009. ,
Computation tree logic with deadlock detection, Logical Methods in Computer Science, vol.5, issue.4, 2009. ,
Branching Time and Abstraction in Bisimulation Semantics, Journal of the ACM, vol.43, issue.3, pp.555-600, 1996. ,
Compositional Minimization of Finite State Systems, Proceedings of the 2nd Workshop on Computer-Aided Verification (CAV'90), vol.531, pp.186-196, 1990. ,
An o(m log n) algorithm for computing stuttering equivalence and branching bisimulation, ACM Transactions on Computational Logic, vol.18, issue.2, 2017. ,
The Syntax and Semantics of µCRL, Centrum voor Wiskunde en Informatica, vol.9076, 1990. ,
Confluence for process verification, Theoretical Computer Science, vol.170, issue.1-2, pp.47-81, 1996. ,
State space reduction using partial ? -confluence, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'00), vol.1893, pp.383-393, 2000. ,
LOTOS -A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, International Organization for Standardization -Information Processing Systems -Open Systems Interconnection, 1989. ,
International Standard 15437:2001, International Organization for Standardization -Information Technology, 2001. ,
Results on the propositional µ-calculus, Theoretical Computer Science, vol.27, pp.333-354, 1983. ,
Compositional State Space Generation from LOTOS Programs, Proceedings of the 3rd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), vol.1217, 1997. ,
, EXP.OPEN 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-the-fly Verification Methods, vol.3771, pp.70-88, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070339
Partial Model Checking using Networks of Labelled Transition Systems and Boolean Equation Systems, Logical Methods in Computer Science, vol.9, issue.4, pp.1-32, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00684471
Compositional verification of concurrent systems by combining bisimulations, Proceedings of the 23rd International Symposium on Formal Methods -3rd World Congress on Formal Methods FM 2019, vol.11800, pp.196-213, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02295459
A Tool for Hierarchical Design and Simulation of Concurrent Systems, Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems, pp.140-152, 1988. ,
Property-Dependent Reductions Adequate with Divergence-Sensitive Branching Bisimilarity, Sci. Comput. Program, vol.96, issue.3, pp.354-376, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01016922
Communication and Concurrency, 1989. ,
Action versus State based Logics for Transition Systems, Lecture Notes in Computer Science, vol.469, pp.407-419, 1990. ,
, Concurrency and Automata on Infinite Sequences, vol.104, pp.167-183, 1981.
In transition from global to modular temporal reasoning about programs. Logic and Models of Concurrent Systems, vol.13, pp.123-144, 1984. ,
Compositional model checking is lively -extended version, 2019. ,
An Algorithmic Procedure for Checking Safety Properties of Protocols, IEEE Transactions on Communications, vol.37, issue.9, pp.940-948, 1989. ,
Propositional dynamic logic of looping and converse, Information and Control, issue.54, pp.121-141, 1982. ,
An Incremental Approach to Reachability Analysis of Distributed Programs, Proceedings of the 7th International Workshop on Software Specification and Design, pp.141-150, 1993. ,
Hierarchy-Based Incremental Reachability Analysis of Communication Protocols, Proceedings of the IEEE International Conference on Network Protocols, pp.318-325, 1993. ,
Compositional State Space Generation, Advances in Petri Nets 1993 -Papers from the 12th International Conference on ,