When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theoretical Computer Science
Ladder Metamodeling and PLC Program Validation through Time Petri Nets
ECMDA-FA '08 Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Formal verification to enhance evolution of protocols
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Aspects of the safety analysis of an on-board automatic train operation supervisor
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
An automated translator for model checking time constrained workflow systems
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
HiLeS2: model driven embedded system virtual prototype generation
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Compositional specification of real time embedded systems by priority time Petri Nets
The Journal of Supercomputing
On the expressive power of timed automata and time petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
NOVA workflow: a workflow management tool targeting health services delivery
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Model checking workflow monitors and its application to a pain management process
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Transition-Based Deadlock Detection and Recovery Policy for FMSs Using Graph Technique
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets or Time Petri nets, preserving certain classes of properties. For Petri nets, these abstractions help preventing combinatorial explosion and rely on so-called partial order techniques such as covering steps and/or persistent sets. For Time Petri nets, that have in general infinite state spaces, they provide finite representation of their behavior, in terms of state class graphs.