Composition of nets Via a communication medium
APN 90 Proceedings on Advances in Petri nets 1990
Compositionality for Improving Model Checking
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Compositional State Space Generation
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
A Client-Server Protocol for the Composition of Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
An Incremental and Modular Technique for Checking LTL\X Properties of Petri Nets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
| Hi-index | 0.00 |
In this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we introduce a non-constraining rela- tion between subnets based on their behaviour. Whenever this relation is satisfied, standard properties like the liveness and the boundedness and generic properties specified by a linear time logic may be checked by examination of the augmented subnets in isolation. Finally, we give a sufficient condition for this relation which can be detected modularly using an efficient algorithm.