Design and validation of computer protocols
Design and validation of computer protocols
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Reachability analysis of Petri nets using symmetries
Systems Analysis Modelling Simulation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
How to calculate symmetries of Petri nets
Acta Informatica
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
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
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Efficient verification of real-time systems: compact data structure and state-space reduction
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A partial order approach to branching time logic model checking
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Hazard Detection in a GALS Wrapper: A Case Study
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Using Petri net invariants in state space construction
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Instantaneous Soundness Checking of Industrial Business Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
How to implement a theory of correctness in the area of business processes and services
BPM'10 Proceedings of the 8th international conference on Business process management
Interaction-centric modeling of process choreographies
Information Systems
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
Applying CEGAR to the petri net state equation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Finding a witness path for non-liveness in free-choice nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Wendy: a tool to synthesize partners for services
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Wendy: A Tool to Synthesize Partners for Services
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Stubborn sets for simple linear time properties
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Tying process model quality to the modeling process: the impact of structuring, movement, and speed
BPM'12 Proceedings of the 10th international conference on Business Process Management
Automatic information flow analysis of business process models
BPM'12 Proceedings of the 10th international conference on Business Process Management
CPN tools 4: multi-formalism and extensibility
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Most specific characteristics of (Place/Transition) Petri nets can be traced back to a few basic features including the monotonicity of the enabling condition, the linearity of the firing rule, and the locality of both. These features enable "Petri net" analysis techniques such as the invariant calculus, the coverability graph technique, approaches based on unfolding, or structural (such as siphon/trap based) analysis. In addition, most verification techniques developed outside the realm of Petri nets can be applied to Petri nets as well. In this paper, we want to demonstrate that the basic features of Petri nets do not only lead to additional analysis techniques, but as well to improved implementations of formalism-independent techniques. As an example, we discuss the explicit generation of a state space. We underline our arguments with some experience from the implementation and use of the Petri net based state space tool LoLA.