eesrg.cc 21.6 KB
Newer Older
1
// Copyright (C) 2003, 2004  Laboratoire d'Informatique de Paris 6 (LIP6),
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// dpartement Systmes Rpartis Coopratifs (SRC), Universit Pierre
// et Marie Curie.
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.

22
23
24
25
#include <cstring>
#include <map>
#include <cassert>
#include <gspnlib.h>
26
#include "eesrg.hh"
27
28
#include "misc/bddlt.hh"
#include <bdd.h>
29
30
#include "tgbaalgos/gtec/explscc.hh"
#include "tgbaalgos/gtec/nsheap.hh"
31
32
33
34

namespace spot
{

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
  namespace
  {
    static bdd*
    bdd_realloc(bdd* t, int size, int new_size)
    {
      assert(new_size);
      bdd* tmp = new bdd[new_size];

      for(int i = 0; i < size; i++)
	tmp[i] = t[i];

      delete[] t;
      return tmp;
    }
  }

51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
  // state_gspn_eesrg
  //////////////////////////////////////////////////////////////////////

  class state_gspn_eesrg: public state
  {
  public:
    state_gspn_eesrg(State left, const state* right)
      : left_(left), right_(right)
    {
    }

    virtual
    ~state_gspn_eesrg()
    {
      delete right_;
    }

    virtual int
    compare(const state* other) const
    {
      const state_gspn_eesrg* o = dynamic_cast<const state_gspn_eesrg*>(other);
      assert(o);
      int res = (reinterpret_cast<char*>(o->left())
		 - reinterpret_cast<char*>(left()));
      if (res != 0)
	return res;
      return right_->compare(o->right());
    }

    virtual size_t
    hash() const
    {
      return (reinterpret_cast<char*>(left())
	      - static_cast<char*>(0)) << 10 + right_->hash();
    }

    virtual state_gspn_eesrg* clone() const
    {
89
      return new state_gspn_eesrg(left(), right()->clone());
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
    }

    State
    left() const
    {
      return left_;
    }

    const state*
    right() const
    {
      return right_;
    }

  private:
    State left_;
    const state* right_;
  }; // state_gspn_eesrg

  // tgba_gspn_eesrg_private_
  //////////////////////////////////////////////////////////////////////

  struct tgba_gspn_eesrg_private_
  {
    int refs;			// reference count

    bdd_dict* dict;
    typedef std::map<int, AtomicProp> prop_map;
    prop_map prop_dict;

    signed char* all_props;

    size_t prop_count;
    const tgba* operand;

    tgba_gspn_eesrg_private_(bdd_dict* dict, const gspn_environment& env,
			     const tgba* operand)
      : refs(1), dict(dict), all_props(0),
	operand(operand)
    {
      const gspn_environment::prop_map& p = env.get_prop_map();

      try
	{
	  AtomicProp max_prop = 0;

	  for (gspn_environment::prop_map::const_iterator i = p.begin();
	       i != p.end(); ++i)
	    {
	      int var = dict->register_proposition(i->second, this);
	      AtomicProp index;
	      int err = prop_index(i->first.c_str(), &index);
	      if (err)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
143
		throw gspn_exeption("prop_index(" + i->first + ")", err);
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175

	      prop_dict[var] = index;

	      max_prop = std::max(max_prop, index);
	    }
	  prop_count = 1 + max_prop;
	  all_props = new signed char[prop_count];
	}
      catch (...)
	{
	  // If an exception occurs during the loop, we need to clean
	  // all BDD variables which have been registered so far.
	  dict->unregister_all_my_variables(this);
	  throw;
	}
    }

    tgba_gspn_eesrg_private_::~tgba_gspn_eesrg_private_()
    {
      dict->unregister_all_my_variables(this);
      if (all_props)
	delete[] all_props;
    }
  };


  // tgba_succ_iterator_gspn_eesrg
  //////////////////////////////////////////////////////////////////////

  class tgba_succ_iterator_gspn_eesrg: public tgba_succ_iterator
  {
  public:
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
    tgba_succ_iterator_gspn_eesrg(Succ_* succ_tgba,
				  size_t size_tgba,
				  bdd* bdd_arry,
				  state** state_arry,
				  size_t size_states,
				  Props_* prop,
				  int size_prop)
      : successors_(succ_tgba),
	size_succ_(size_tgba),
	current_succ_(0),
	bdd_array_(bdd_arry),
	state_array_(state_arry),
	size_states_(size_states),
	props_(prop),
	size_prop_(size_prop)
191
192
193
194
195
196
197
    {
    }

    virtual
    ~tgba_succ_iterator_gspn_eesrg()
    {

198
199
      for(size_t i = 0; i < size_states_; i++)
      	delete state_array_[i];
200

201
202
      delete[] bdd_array_;
      free(state_array_);
203

204
205
206
207
208
209
      if (props_)
	{
	  for (int i = 0; i < size_prop_; i++)
	    free(props_[i].arc);
	  free(props_);
	}
210

211
212
      if (size_succ_ != 0)
	succ_free(successors_);
213

214
215
216
217
218
    }

    virtual void
    first()
    {
219
220
221
      if(!successors_)
	return    ;
      current_succ_=0;
222
223
224
225
226
    }

    virtual void
    next()
    {
227
      current_succ_++;
228
229
230
231
232
    }

    virtual bool
    done() const
    {
233
      return current_succ_ + 1 > size_succ_;
234
235
236
237
238
    }

    virtual state*
    current_state() const
    {
239
240
241
242
      return
	new state_gspn_eesrg(successors_[current_succ_].succ_,
			     (state_array_[successors_[current_succ_]
					   .arc->curr_state])->clone());
243
244
245
246
247
248
249
250
251
    }

    virtual bdd
    current_condition() const
    {
      return bddtrue;
    }

    virtual bdd
252
    current_acceptance_conditions() const
253
254
255
    {
      // There is no acceptance conditions in GSPN systems, so we just
      // return those from OPERAND_.
256
257
258
259
      // return operand_->current_acceptance_conditions();
      // bdd * ac=(bdd *)successors_[current_succ_].arc->curr_acc_conds;
      //return (*ac);
      return bdd_array_[successors_[current_succ_].arc->curr_acc_conds];
260
261
    }
  private:
262

263
264
    // All successors of STATE matching a selection conjunctions from
    // ALL_CONDS.
265
266
267
268
269
270
271
272
273
    Succ_* successors_;		/// array of successors
    size_t size_succ_;		/// size of successors_
    size_t current_succ_;		/// current position in successors_

    bdd * bdd_array_;
    state** state_array_;
    size_t size_states_;
    Props_* props_;
    int size_prop_;
274
275
276
277
278
279
  }; // tgba_succ_iterator_gspn_eesrg


  // tgba_gspn_eesrg
  //////////////////////////////////////////////////////////////////////

280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
  class tgba_gspn_eesrg: public tgba
  {
  public:
    tgba_gspn_eesrg(bdd_dict* dict, const gspn_environment& env,
		    const tgba* operand);
    tgba_gspn_eesrg(const tgba_gspn_eesrg& other);
    tgba_gspn_eesrg& operator=(const tgba_gspn_eesrg& other);
    virtual ~tgba_gspn_eesrg();
    virtual state* get_init_state() const;
    virtual tgba_succ_iterator*
    succ_iter(const state* local_state,
	      const state* global_state = 0,
	      const tgba* global_automaton = 0) const;
    virtual bdd_dict* get_dict() const;
    virtual std::string format_state(const state* state) const;
    virtual state* project_state(const state* s, const tgba* t) const;
    virtual bdd all_acceptance_conditions() const;
    virtual bdd neg_acceptance_conditions() const;
  protected:
    virtual bdd compute_support_conditions(const spot::state* state) const;
    virtual bdd compute_support_variables(const spot::state* state) const;
  private:
    tgba_gspn_eesrg_private_* data_;
  };
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335

  tgba_gspn_eesrg::tgba_gspn_eesrg(bdd_dict* dict, const gspn_environment& env,
				   const tgba* operand)
  {
    data_ = new tgba_gspn_eesrg_private_(dict, env, operand);
  }

  tgba_gspn_eesrg::tgba_gspn_eesrg(const tgba_gspn_eesrg& other)
    : tgba()
  {
    data_ = other.data_;
    ++data_->refs;
  }

  tgba_gspn_eesrg::~tgba_gspn_eesrg()
  {
    if (--data_->refs == 0)
      delete data_;
  }

  tgba_gspn_eesrg&
  tgba_gspn_eesrg::operator=(const tgba_gspn_eesrg& other)
  {
    if (&other == this)
      return *this;
    this->~tgba_gspn_eesrg();
    new (this) tgba_gspn_eesrg(other);
    return *this;
  }

  state* tgba_gspn_eesrg::get_init_state() const
  {
336
337
338
339
    // Use 0 as initial state for the EESRG side.  State 0 does not
    // exists, but when passed to succ() it will produce the list
    // of initial states.
    return new state_gspn_eesrg(0, data_->operand->get_init_state());
340
341
342
  }

  tgba_succ_iterator*
343
  tgba_gspn_eesrg::succ_iter(const state* state_,
344
345
			     const state* global_state,
			     const tgba* global_automaton) const
346
  {
347
    const state_gspn_eesrg* s = dynamic_cast<const state_gspn_eesrg*>(state_);
348
349
350
    assert(s);
    (void) global_state;
    (void) global_automaton;
351
352
353
354
355
356
357
358
359
360
361
362

    bdd all_conds_;
    bdd outside_;
    bdd cond;

    Props_* props_ = 0;
    int nb_arc_props = 0;
    bdd* bdd_array = 0;
    int size_bdd = 0;
    state** state_array = 0;
    size_t size_states = 0;

363
    tgba_succ_iterator* i = data_->operand->succ_iter(s->right());
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442

    for (i->first(); !i->done(); i->next())
      {
	all_conds_ = i->current_condition();
	outside_ = !all_conds_;

	if (all_conds_ != bddfalse)
	  {
	    props_ = (Props_*) realloc(props_,
				       (nb_arc_props + 1) * sizeof(Props_));

	    props_[nb_arc_props].nb_conj = 0;
	    props_[nb_arc_props].prop = 0;
	    props_[nb_arc_props].arc =
	      (Arc_Ident_*) malloc(sizeof(Arc_Ident_));

	    bdd_array = bdd_realloc(bdd_array, size_bdd, size_bdd + 1);
	    bdd_array[size_bdd] = i->current_acceptance_conditions();
	    props_[nb_arc_props].arc->curr_acc_conds = size_bdd;
	    size_bdd++;

            state_array = (state**) realloc(state_array,
					    (size_states + 1) * sizeof(state*));
	    state_array[size_states] = i->current_state();
	    props_[nb_arc_props].arc->curr_state  = size_states ;
            size_states++;

	    while (all_conds_ != bddfalse )
	      {
		cond = bdd_satone(all_conds_);
		cond = bdd_simplify(cond, cond | outside_);
		all_conds_ -= cond;

		props_[nb_arc_props].prop =
		  (signed char **) realloc(props_[nb_arc_props].prop,
					   (props_[nb_arc_props].nb_conj + 1)
					   * sizeof(signed char *));

		props_[nb_arc_props].prop[props_[nb_arc_props].nb_conj]
		  = (signed char*) calloc(data_->prop_count,
					  sizeof(signed char));
		memset(props_[nb_arc_props].prop[props_[nb_arc_props].nb_conj],
		       -1, data_->prop_count);

		while (cond != bddtrue)
		  {
		    int var = bdd_var(cond);
		    bdd high = bdd_high(cond);
		    int res;

		    if (high == bddfalse)
		      {
			cond = bdd_low(cond);
			res = 0;
		      }
		    else
		      {
			cond = high;
			res = 1;
		      }

		    tgba_gspn_eesrg_private_::prop_map::iterator k
		      = data_->prop_dict.find(var);

		    if (k != data_->prop_dict.end())
		      props_[nb_arc_props]
			.prop[props_[nb_arc_props].nb_conj][k->second] = res;

		    assert(cond != bddfalse);
		  }
		++props_[nb_arc_props].nb_conj;
	      }
	    ++nb_arc_props;
	  }
      }
     Succ_* succ_tgba_ = 0;
     size_t size_tgba_ = 0;
     int j, conj;

443
     succ(s->left(), props_, nb_arc_props, &succ_tgba_, &size_tgba_);
444
445
446
447
448
449
450
451
452
453
454
455
456

     for (j = 0; j < nb_arc_props; j++)
       {
	 for (conj = 0 ; conj < props_[j].nb_conj ; conj++)
	   free(props_[j].prop[conj]);
	 free(props_[j].prop);
       }

     delete i;
     return new tgba_succ_iterator_gspn_eesrg(succ_tgba_, size_tgba_,
					      bdd_array, state_array,
					      size_states, props_,
					      nb_arc_props);
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
  }

  bdd
  tgba_gspn_eesrg::compute_support_conditions(const spot::state* state) const
  {
    (void) state;
    return bddtrue;
  }

  bdd
  tgba_gspn_eesrg::compute_support_variables(const spot::state* state) const
  {
    (void) state;
    return bddtrue;
  }

  bdd_dict*
  tgba_gspn_eesrg::get_dict() const
  {
    return data_->dict;
  }

  std::string
  tgba_gspn_eesrg::format_state(const state* state) const
  {
    const state_gspn_eesrg* s = dynamic_cast<const state_gspn_eesrg*>(state);
    assert(s);
    char* str;
485
486
487
488
489
490
    State gs = s->left();
    if (gs)
      {
	int err = print_state(gs, &str);
	if (err)
	  throw gspn_exeption("print_state()", err);
491
492
493
494
	// Strip trailing \n...
	unsigned len = strlen(str);
	while (str[--len] == '\n')
	  str[len] = 0;
495
496
497
498
499
      }
    else
      {
	str = strdup("-1");
      }
500

501
    std::string res(str);
502
    free(str);
503
    return res + " * " + data_->operand->format_state(s->right());
504
505
  }

506
507
508
509
510
511
512
513
514
515
  state*
  tgba_gspn_eesrg::project_state(const state* s, const tgba* t) const
  {
    const state_gspn_eesrg* s2 = dynamic_cast<const state_gspn_eesrg*>(s);
    assert(s2);
    if (t == this)
      return s2->clone();
    return data_->operand->project_state(s2->right(), t);
  }

516
  bdd
517
  tgba_gspn_eesrg::all_acceptance_conditions() const
518
  {
519
520
521
    // There is no acceptance conditions in GSPN systems, they all
    // come from the operand automaton.
    return data_->operand->all_acceptance_conditions();
522
523
524
  }

  bdd
525
  tgba_gspn_eesrg::neg_acceptance_conditions() const
526
  {
527
528
529
    // There is no acceptance conditions in GSPN systems, they all
    // come from the operand automaton.
    return data_->operand->neg_acceptance_conditions();
530
531
  }

532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
  // gspn_eesrg_interface
  //////////////////////////////////////////////////////////////////////

  gspn_eesrg_interface::gspn_eesrg_interface(int argc, char **argv,
					     bdd_dict* dict,
					     const gspn_environment& env)
    : dict_(dict), env_(env)
  {
    int res = initialize(argc, argv);
    if (res)
      throw gspn_exeption("initialize()", res);
  }

  gspn_eesrg_interface::~gspn_eesrg_interface()
  {
    int res = finalize();
    if (res)
      throw gspn_exeption("finalize()", res);
  }

  tgba*
  gspn_eesrg_interface::automaton(const tgba* operand) const
  {
    return new tgba_gspn_eesrg(dict_, env_, operand);
  }

558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582

  //////////////////////////////////////////////////////////////////////

  class connected_component_eesrg: public explicit_connected_component
  {
  public:
    virtual
    ~connected_component_eesrg()
    {
    }

    virtual const state*
    has_state(const state* s) const
    {
      set_type::iterator i;

      for (i = states.begin(); i !=states.end(); i++)
	{
	  const state_gspn_eesrg* old_state = (const state_gspn_eesrg*)(*i);
	  const state_gspn_eesrg* new_state = (const state_gspn_eesrg*)(s);

	  if ((old_state->right())->compare(new_state->right()) == 0
	      && old_state->left()
	      && new_state->left())
	    if (spot_inclusion(new_state->left(), old_state->left()))
583
584
585
586
587
	      {
		if (*i != s)
		  delete s;
		return *i;
	      }
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
	}
      return 0;
    }

    virtual void
    insert(const state* s)
    {
      states.insert(s);
    }

  protected:
    typedef Sgi::hash_set<const state*,
			  state_ptr_hash, state_ptr_equal> set_type;
    set_type states;
  };

  class connected_component_eesrg_factory :
    public explicit_connected_component_factory
  {
  public:
    virtual connected_component_eesrg*
    build() const
    {
      return new connected_component_eesrg();
    }

    /// Get the unique instance of this class.
    static const connected_component_eesrg_factory*
    instance()
    {
      static connected_component_eesrg_factory f;
      return &f;
    }

  protected:
    virtual
    ~connected_component_eesrg_factory()
    {
    }
    /// Construction is forbiden.
    connected_component_eesrg_factory()
    {
    }
  };

  //////////////////////////////////////////////////////////////////////


  class numbered_state_heap_eesrg_semi : public numbered_state_heap
  {
  public:
    virtual
    ~numbered_state_heap_eesrg_semi()
    {
      // Free keys in H.
      hash_type::iterator i = h.begin();
      while (i != h.end())
	{
	  // Advance the iterator before deleting the key.
	  const state* s = i->first;
	  ++i;
	  delete s;
	}
    }

    virtual const int*
    find(const state* s) const
    {
      hash_type::const_iterator i;
      for (i = h.begin(); i != h.end(); ++i)
	{
	  const state_gspn_eesrg* old_state =
	    dynamic_cast<const state_gspn_eesrg*>(i->first);
	  const state_gspn_eesrg* new_state =
	    dynamic_cast<const state_gspn_eesrg*>(s);
	  assert(old_state);
	  assert(new_state);

	  if ((old_state->right())->compare(new_state->right()) == 0)
	    {
	      if (old_state->left() == new_state->left())
		break;

	      if (old_state->left()
		  && new_state->left()
		  && spot_inclusion(new_state->left(),old_state->left()))
		break;
	    }
	}
      if (i == h.end())
	return 0;
      return &i->second;
    }

    virtual int*
    find(const state* s)
    {
      return const_cast<int*>
	(const_cast<const numbered_state_heap_eesrg_semi*>(this)->find(s));
    }

    virtual void
    insert(const state* s, int index)
    {
      h[s] = index;
    }

    virtual int
    size() const
    {
      return h.size();
    }

    virtual numbered_state_heap_const_iterator* iterator() const;

    virtual const state*
    filter(const state* s) const
    {
      hash_type::const_iterator i;
      for (i = h.begin(); i != h.end(); ++i)
	{
	  const state_gspn_eesrg* old_state =
	    dynamic_cast<const state_gspn_eesrg*>(i->first);
	  const state_gspn_eesrg* new_state =
	    dynamic_cast<const state_gspn_eesrg*>(s);
	  assert(old_state);
	  assert(new_state);

	  if ((old_state->right())->compare(new_state->right()) == 0)
	    {
	      if (old_state->left() == new_state->left())
		break;

	      if (old_state->left()
		  && new_state->left()
		  && spot_inclusion(new_state->left(),old_state->left()))
		break;
	    }
	}
      assert(i != h.end());
      if (s != i->first)
	delete s;
      return i->first;
    }

  protected:
    typedef Sgi::hash_map<const state*, int,
			  state_ptr_hash, state_ptr_equal> hash_type;
    hash_type h;		///< Map of visited states.

    friend class numbered_state_heap_eesrg_const_iterator;
739
    friend class emptiness_check_shy_eesrg;
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
  };


  class numbered_state_heap_eesrg_const_iterator :
    public numbered_state_heap_const_iterator
  {
  public:
    numbered_state_heap_eesrg_const_iterator
      (const numbered_state_heap_eesrg_semi::hash_type& h)
	: numbered_state_heap_const_iterator(), h(h)
    {
    }

    ~numbered_state_heap_eesrg_const_iterator()
    {
    }

    virtual void
    first()
    {
      i = h.begin();
    }

    virtual void
    next()
    {
      ++i;
    }

    virtual bool
    done() const
    {
      return i == h.end();
    }

    virtual const state*
    get_state() const
    {
      return i->first;
    }

    virtual int
    get_index() const
    {
      return i->second;
    }

  private:
    numbered_state_heap_eesrg_semi::hash_type::const_iterator i;
    const numbered_state_heap_eesrg_semi::hash_type& h;
  };

792

793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
  numbered_state_heap_const_iterator*
  numbered_state_heap_eesrg_semi::iterator() const
  {
    return new numbered_state_heap_eesrg_const_iterator(h);
  }


  /// \brief Factory for numbered_state_heap_eesrg_semi
  ///
  /// This class is a singleton.  Retrieve the instance using instance().
  class numbered_state_heap_eesrg_factory_semi:
    public numbered_state_heap_factory
  {
  public:
    virtual numbered_state_heap_eesrg_semi*
    build() const
    {
      return new numbered_state_heap_eesrg_semi();
    }

    /// Get the unique instance of this class.
    static const numbered_state_heap_eesrg_factory_semi*
    instance()
    {
      static numbered_state_heap_eesrg_factory_semi f;
      return &f;
    }

  protected:
    virtual
    ~numbered_state_heap_eesrg_factory_semi()
    {
    }

    numbered_state_heap_eesrg_factory_semi()
    {
    }
  };


833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
  class emptiness_check_shy_eesrg : public emptiness_check_shy
  {
  public:
    emptiness_check_shy_eesrg(const tgba* a)
      : emptiness_check_shy(a,
			    numbered_state_heap_eesrg_factory_semi::instance())
    {
    }

  protected:
    virtual int*
    find_state(const state* s)
    {
      typedef numbered_state_heap_eesrg_semi::hash_type hash_type;
      hash_type& h = dynamic_cast<numbered_state_heap_eesrg_semi*>(ecs_->h)->h;

      hash_type::iterator i;
      for (i = h.begin(); i != h.end(); ++i)
	{
	  const state_gspn_eesrg* old_state =
	    dynamic_cast<const state_gspn_eesrg*>(i->first);
	  const state_gspn_eesrg* new_state =
	    dynamic_cast<const state_gspn_eesrg*>(s);
	  assert(old_state);
	  assert(new_state);

	  if ((old_state->right())->compare(new_state->right()) == 0)
	    {
	      if (old_state->left() == new_state->left())
		break;

	      if (old_state->left() && new_state->left())
		{
		  if (i->second == -1)
		    {
		      if (spot_inclusion(new_state->left(), old_state->left()))
			break;
		    }
		  else
		    {
		      if (spot_inclusion(old_state->left(), new_state->left()))
			{
			  State* succ_tgba_ = NULL;
			  size_t size_tgba_ = 0;
			  succ_queue& queue = todo.top().second;

			  Diff_succ(old_state->left(), new_state->left(),
				    &succ_tgba_, &size_tgba_);

			  for (size_t i = 0; i < size_tgba_; i++)
			    {
			      state_gspn_eesrg* s =
				new state_gspn_eesrg
				  (succ_tgba_[i],
				   old_state->right()->clone());
			      queue.push_back(successor(queue.begin()->acc, s));
			    }
			  if (size_tgba_ != 0)
			    diff_succ_free(succ_tgba_);
			  break;
			}
		    }
		}
	    }
	}
      if (i == h.end())
	return 0;
      return &i->second;
    }
  };



906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
  emptiness_check*
  emptiness_check_eesrg_semi(const tgba* eesrg_automata)
  {
    assert(dynamic_cast<const tgba_gspn_eesrg*>(eesrg_automata));
    return
      new emptiness_check(eesrg_automata,
			  numbered_state_heap_eesrg_factory_semi::instance());
  }

  emptiness_check*
  emptiness_check_eesrg_shy_semi(const tgba* eesrg_automata)
  {
    assert(dynamic_cast<const tgba_gspn_eesrg*>(eesrg_automata));
    return
      new emptiness_check_shy
        (eesrg_automata,
	 numbered_state_heap_eesrg_factory_semi::instance());
  }

925
926
927
928
929
930
931
  emptiness_check*
  emptiness_check_eesrg_shy(const tgba* eesrg_automata)
  {
    assert(dynamic_cast<const tgba_gspn_eesrg*>(eesrg_automata));
    return new emptiness_check_shy_eesrg(eesrg_automata);
  }

932
933
934
935
936
937
  counter_example*
  counter_example_eesrg(const emptiness_check_status* status)
  {
    return new counter_example(status,
			       connected_component_eesrg_factory::instance());
  }
938
}