Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Reduction: a method of proving properties of parallel programs
Communications of the ACM
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Net Reductions for LTL Model-Checking
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Reductions of Nets and Parallel Prgrams
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Covering Step Graph Preserving Failure Semantics
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
A reduction theory for coloured nets
Advances in Petri Nets 1989, covers the 9th European Workshop on Applications and Theory in Petri Nets-selected papers
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A type and effect system for atomicity
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Pre-and post-gglomerations for LTL model checking
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Bisimulation and the reduction of Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Quasar: a new tool for concurrent Ada programs analysis
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Optimistic synchronization-based state-space reduction
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Formal Support for QVT-Relations with Coloured Petri Nets
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
On the computation of stubborn sets of colored petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
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
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
A Model Slicing Method for Workflow Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.05 |
In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread) and global algebraic ones (e.g. related to the threads synchronization). We show that these conditions are performed in a syntactical way, when a syntax of the color mappings is given. We show also how our method outperforms previous ones on a recent case study with regard both to the reduction ratio and the automatization of their application.