Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Free choice Petri nets
Complexity results for 1-safe nets
Theoretical Computer Science
Selecting test sequences for partially-specified nondeterministic finite state machines
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Resolving observability problems in distributed test architectures
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A fresh look at testing for asynchronous communication
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Local testing of message sequence charts is difficult
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Petri nets have been widely studied as tool for specification, modeling and analysis of concurrent systems. However, surprisingly little research has been done for testing systems that are specified with Petri nets. When a formal model is used, variations of Finite State Machines are often used for the automated generation of test cases. In this paper, we study automated conformance testing when the formal specification is given as a k- safe Petri net. We provide a general framework to perform these tests, and give a few algorithms for test case generation based on different assumptions. We provide two inefficient, but general algorithms for k- safe Petri net conformance testing. We also provide efficient algorithms for testing k- safe free-choice Petri nets under specific fault assumptions.