Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The existence of refinement mappings
Theoretical Computer Science
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Turning SOS rules into equations
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A process algebra with distributed priorities
Theoretical Computer Science
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Communication and Concurrency
Dynamic Priorities for Modeling Real-Time
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Modelling Timeouts without Timelocks
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
The Compositional Specification of Timed Systems - A Tutorial
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Analysis of the zeroconf protocol using UPPAAL
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Foundations of a compositional interchange format for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
The spotlight principle: on combining process-summarizing state abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Formal specification and analysis of zeroconf using uppaalS
ACM Transactions on Embedded Computing Systems (TECS)
An alternative definition for timed automata composition
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Revising and extending the uppaal communication mechanism
SC'12 Proceedings of the 11th international conference on Software Composition
Revisiting timed specification theories: a linear-time perspective
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
The idea to use simulations (or refinements) as a compositional abstraction device is well-known, both in untimed and timed settings, and has already been studied theoretically and practically in many papers during the last three decades. Nevertheless, existing approaches do not handle two fundamental modeling concepts which, for instance, are frequently used in the popular Uppaalmodel checker: (1) a parallel composition operator that supports communication via shared variables as well as synchronization of actions, and (2) committed locations. We describe a framework for compositional abstraction based on simulation relations that does support both concepts, and that is suitable for Uppaal. Our approach is very general and the only essential restriction is that the guards of input transitions do not depend on external variables. We have applied our compositional framework to verify the Zeroconf protocol for an arbitrary number of hosts.