Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
PETRI NET LANGUAGE
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Extended Timed Automata and Time Petri Nets
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Comparison of the expressiveness of arc, place and transition time Petri nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Bridging the gap between timed automata and bounded time petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
When are timed automata weakly timed bisimilar to time petri nets?
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A formal framework to specify and verify real-time properties on critical systems
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
Complex systems are often designed and built from smaller pieces, called components. Components are open sub-systems meant to be combined (or composed) to form other components or closed systems. It is well known that Petri nets allow such a component based modeling, relying on parallel composition and transition synchronization. However, synchronizing transitions that carry temporal constraints does not yield a compositional method for assembling components, a highly desirable property. The paper addresses this particular problem: how to build complex systems in a compositional manner from components specified by Time Petri nets (TPN). A first solution is proposed, adequate for a particular subclass of Time Petri nets but significantly increasing the complexity of components. Then an improved solution is developed, relying on an extension of Time Petri nets with two relations added on transitions. This latter solution requires a much simpler transformation of nets, does not significantly increase their complexity, and is applicable to a larger class of TPN.