scientific article; zbMATH DE number 1278351
From MaRDI portal
Publication:4239305
zbMATH Open0928.68068MaRDI QIDQ4239305FDOQ4239305
Authors: Kimmo Varpaaniemi
Publication date: 25 April 1999
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)
Cited In (13)
- On the Computation of Stubborn Sets of Colored Petri Nets
- Exploring the scope for partial order reduction
- Can stubborn sets be optimal?
- Title not available (Why is that?)
- Stubborn set intuition explained
- An efficient algorithm for the computation of stubborn sets of well formed Petri nets
- Question-guided stubborn set methods for state properties
- A stubborn set algorithm for optimal planning
- Stubborn sets for simple linear time properties
- On Stubborn Sets in the Verification of Linear Time Temporal Properties
- Title not available (Why is that?)
- On stubborn sets in the verification of linear time temporal properties
- More stubborn set methods for process algebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239305)