Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
Communicating sequential processes
Communications of the ACM
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Automated Software Engineering
A Graphical Parallel Composition Operator for Process Algebras
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
SVL: A Scripting Language for Compositional Verification
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Compositional State Space Generation from Lotos Programs
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
MEC: A System for Constructing and Analysing Transition Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Compositional State Space Generation
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
LTSA-WS: a tool for model-based verification of web service compositions and choreography
Proceedings of the 28th international conference on Software engineering
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
A Model-Based Approach to the Verification and Adaptation of WF/.NET Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the conference on Design, automation and test in Europe
Architectural Availability Analysis of Software Decomposition for Local Recovery
SSIRI '09 Proceedings of the 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement
Electronic Notes in Theoretical Computer Science (ENTCS)
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A compositional semantics for dynamic fault trees in terms of interactive Markov chains
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Aggregation Ordering for Massively Compositional Models
ACSD '10 Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design
A LOTOS framework for middleware specification
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Checking the realizability of BPMN 2.0 choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample guided synthesis of monitors for realizability enforcement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An experience report on the verification of autonomic protocols in the cloud
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
Compositional aggregation is a technique to palliate state explosion --the phenomenon that the behaviour graph of a parallel composition of asynchronous processes grows exponentially with the number of processes -- which is the main drawback of explicit-state verification. It consists in building the behaviour graph by incrementally composing and minimizing parts of the composition modulo an equivalence relation. Heuristics have been proposed for finding an appropriate composition order that keeps the size of the largest intermediate graph small enough. Yet the underlying composition models are not general enough for systems involving elaborate forms of synchronization, such as multiway and/or nondeterministic synchronizations. We overcome this by proposing a generalization of compositional aggregation that applies to an expressive composition model based on synchronization vectors, subsuming many composition operators. Unlike some algebraic composition models, this model enables any composition order to be used. We also present an implementation of this approach within the Cadp verification toolbox in the form of a new operator called smart reduction, as well as experimental results assessing the efficiency of smart reduction.