Partial order verification with PEP
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
The Reference Component of PEP
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An M-Net Semantics for a Real-Time Extension of µSDL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Towards Compositional Verification of SDL Systems
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
A Petri Net Semantics for B(PN)^2 with Procedures
PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Real-Time Systems Design with PEP
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
System Specification and Verification Using High Level Concepts - A Tool Demonstration
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Compositional semantics for UML 2.0 sequence diagrams using petri nets
SDL'05 Proceedings of the 12th international conference on Model Driven
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
In this paper a compositional high-level Petri net semantics for SDL (Specification and Description Language) is presented. Emphasis is laid on the modelling of dynamic creation and termination of processes and of procedures-features, which are, for instance, essential for typical client-server systems. In a preliminary paper we have already shown that we are able to use 'state of the art' verification techniques by basing our approach on M-nets (an algebra of high-level Petri nets). Therefore, this paper concentrates on the details of the semantics. A distinctive feature of the presented solution is that the 'infinite case' (infinitely many concurrent process and procedure instances as well as unbounded capacities of input queues and channels) is covered.