Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Software engineering: stretching the limits of complexity
Communications of the ACM
Formal Methods: Promises and Problems
IEEE Software
An Introduction to Rapid System Prototyping
IEEE Transactions on Software Engineering
Data Decision Diagrams for Petri Net Analysis
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Model Checking UML Statechart Diagrams Using JACK
HASE '99 The 4th IEEE International Symposium on High-Assurance Systems Engineering
Automated Translation of UML Models of Architectures for Verification and Simulation Using SPIN
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
Service Creation: A Model-Based Approach
FTDCS '99 Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computing Systems
Towards dynamic partitioning of reactive system behavior: a train controller case study
Proceedings of the 12th Monterey conference on Reliable systems on unreliable networked platforms
| Hi-index | 0.00 |
Design of reliable distributed systems is stretching limits in term of complexity since existing development techniques are usually not fully accurate for this type of applications. One of the main problem is the gap between the various notations used during development process. Even if UML is an important step forward in this domain, it is not fully suitable for formal description of distributed systems. In this chapter, we present the LfP (Language for Prototyping) notation. It is dedicated to formally describe distributed (potentially embedded) systems. We show how LfP may serve as an input for formal verification using Data Decision Diagrams (DDD), an extension of Binary Decision Diagrams (BDD) enabling a compact representation of state spaces. Some aspects of the BART case study will be presented and we show what type of behavioral properties we may verify on this specification.