ltl2tgba.cc 16.1 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Copyright (C) 2003, 2004  Laboratoire d'Informatique de Paris 6 (LIP6),
// 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
#include <iostream>
#include <cassert>
24
25
#include <fstream>
#include <string>
26
#include "ltlvisit/destroy.hh"
27
#include "ltlvisit/reduce.hh"
28
#include "ltlvisit/tostring.hh"
29
#include "ltlvisit/apcollect.hh"
30
31
#include "ltlast/allnodes.hh"
#include "ltlparse/public.hh"
32
#include "tgbaalgos/ltl2tgba_lacim.hh"
33
#include "tgbaalgos/ltl2tgba_fm.hh"
34
#include "tgba/bddprint.hh"
35
#include "tgbaalgos/dotty.hh"
36
#include "tgbaalgos/lbtt.hh"
37
#include "tgba/tgbatba.hh"
38
#include "tgbaalgos/magic.hh"
39
40
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/gtec/ce.hh"
41
#include "tgbaparse/public.hh"
42
#include "tgbaalgos/dupexp.hh"
43
#include "tgbaalgos/neverclaim.hh"
44
#include "tgbaalgos/reductgba_sim.hh"
45
#include "tgbaalgos/replayrun.hh"
46

47
48
49
void
syntax(char* prog)
{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
50
  std::cerr << "Usage: "<< prog << " [OPTIONS...] formula" << std::endl
51
            << "       "<< prog << " -F [OPTIONS...] file" << std::endl
52
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
53
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
54
	    << "Options:" << std::endl
martinez's avatar
martinez committed
55
	    << "  -a    display the acceptance_conditions BDD, not the "
56
	    << "reachability graph"
57
	    << std::endl
martinez's avatar
martinez committed
58
59
60
61
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -d    turn on traces during parsing" << std::endl
	    << "  -D    degeneralize the automaton" << std::endl
	    << "  -e    emptiness-check (Couvreur), expect and compute "
62
	    << "a counter-example" << std::endl
martinez's avatar
martinez committed
63
	    << "  -e2   emptiness-check (Couvreur variant), expect and compute "
64
	    << "a counter-example" << std::endl
martinez's avatar
martinez committed
65
	    << "  -E    emptiness-check (Couvreur), expect no counter-example "
66
	    << std::endl
martinez's avatar
martinez committed
67
	    << "  -E2   emptiness-check (Couvreur variant), expect no "
68
	    << "counter-example " << std::endl
martinez's avatar
martinez committed
69
70
71
72
73
74
75
76
            << "  -f    use Couvreur's FM algorithm for translation"
	    << std::endl
            << "  -F    read the formula from the file" << std::endl
            << "  -L    fair-loop approximation (implies -f)" << std::endl
	    << "  -m    magic-search (implies -D), expect a counter-example"
	    << std::endl
	    << "  -M    magic-search (implies -D), expect no counter-example"
	    << std::endl
martinez's avatar
martinez committed
77
78
79
80
	    << "  -n    same as -m, but display more counter-examples"
	    << std::endl
	    << "  -N    display the never clain for Spin "
	    << "(implies -D)" << std::endl
martinez's avatar
martinez committed
81
82
            << "  -p    branching postponement (implies -f)" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
83
	    << std::endl
martinez's avatar
martinez committed
84
85
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
86
	    << "and universality" << std::endl
martinez's avatar
martinez committed
87
	    << "  -r3   reduce formula using implication between "
88
	    << "sub-formulae" << std::endl
martinez's avatar
martinez committed
89
90
91
	    << "  -r4   reduce formula using all rules" << std::endl
	    << "  -rd   display the reduce formula" << std::endl
	    << "  -R    same as -r, but as a set" << std::endl
martinez's avatar
martinez committed
92
	    << "  -R1q  use direct simulation to merge some state "
martinez's avatar
martinez committed
93
	    << "(use -L for more reduction)"
94
	    << std::endl
martinez's avatar
martinez committed
95
	    << "  -R1t  use direct simulation to remove some transition "
martinez's avatar
martinez committed
96
	    << "(use -L for more reduction)"
97
	    << std::endl
martinez's avatar
martinez committed
98
99
100
101
102
103
	    << "  -R2q  use delayed simulation to merge some state "
	    << "(the automaton must be degeneralised)"
	    << std::endl
	    << "  -R2t  use delayed simulation to remove some transition "
	    << "(the automaton must be degeneralised)"
	    << std::endl
martinez's avatar
martinez committed
104
	    << "  -R3   use SCC to reduce the automata"
105
	    << std::endl
martinez's avatar
martinez committed
106
	    << "  -Rd   display the simulation relation"
107
	    << std::endl
martinez's avatar
martinez committed
108
	    << "  -RD   display the parity game (dot format)"
109
	    << std::endl
martinez's avatar
martinez committed
110
	    << "  -s    convert to explicit automata, and number states "
111
	    << "in DFS order" << std::endl
martinez's avatar
martinez committed
112
	    << "  -S    convert to explicit automata, and number states "
113
	    << "in BFS order" << std::endl
martinez's avatar
martinez committed
114
	    << "  -t    display reachable states in LBTT's format" << std::endl
115
116
            << "  -U[PROPS]  consider atomic properties PROPS as exclusive "
	    << "events (implies -f)" << std::endl
martinez's avatar
martinez committed
117
118
119
	    << "  -v    display the BDD variables used by the automaton"
	    << std::endl
            << "  -x    try to produce a more deterministic automata "
120
	    << "(implies -f)" << std::endl
martinez's avatar
martinez committed
121
	    << "  -X    do not compute an automaton, read it from a file"
122
	    << std::endl
martinez's avatar
martinez committed
123
	    << "  -y    do not merge states with same symbolic representation "
124
	    << "(implies -f)" << std::endl;
125
126
127
128
129
130
131
132
  exit(2);
}

int
main(int argc, char** argv)
{
  int exit_code = 0;

133
  bool debug_opt = false;
134
  bool degeneralize_opt = false;
135
  bool fm_opt = false;
136
  bool fm_exprop_opt = false;
137
  bool fm_symb_merge_opt = true;
138
  bool file_opt = false;
139
  int output = 0;
140
  int formula_index = 0;
141
  enum { None, Couvreur, Couvreur2, MagicSearch } echeck = None;
142
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
143
144
  bool magic_many = false;
  bool expect_counter_example = false;
145
  bool from_file = false;
146
  int reduc_aut = spot::Reduce_None;
147
  int redopt = spot::ltl::Reduce_None;
148
149
  bool display_reduce_form = false;
  bool display_rel_sim = false;
150
  bool display_parity_game = false;
151
  bool post_branching = false;
152
  bool fair_loop_approx = false;
153
154
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
155

156
  for (;;)
157
    {
158
      if (argc < formula_index + 2)
159
	syntax(argv[0]);
160
161
162

      ++formula_index;

163
164
165
166
167
168
169
170
171
      if (!strcmp(argv[formula_index], "-a"))
	{
	  output = 2;
	}
      else if (!strcmp(argv[formula_index], "-A"))
	{
	  output = 4;
	}
      else if (!strcmp(argv[formula_index], "-d"))
172
173
174
	{
	  debug_opt = true;
	}
175
176
177
178
      else if (!strcmp(argv[formula_index], "-D"))
	{
	  degeneralize_opt = true;
	}
179
180
181
182
183
184
      else if (!strcmp(argv[formula_index], "-e"))
	{
	  echeck = Couvreur;
	  expect_counter_example = true;
	  output = -1;
	}
185
186
187
188
189
190
      else if (!strcmp(argv[formula_index], "-e2"))
	{
	  echeck = Couvreur2;
	  expect_counter_example = true;
	  output = -1;
	}
191
192
193
194
195
196
      else if (!strcmp(argv[formula_index], "-E"))
	{
	  echeck = Couvreur;
	  expect_counter_example = false;
	  output = -1;
	}
197
198
199
200
201
202
      else if (!strcmp(argv[formula_index], "-E2"))
	{
	  echeck = Couvreur2;
	  expect_counter_example = false;
	  output = -1;
	}
203
204
205
206
207
208
209
210
      else if (!strcmp(argv[formula_index], "-f"))
	{
	  fm_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
211
212
213
214
215
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
	  fm_opt = true;
	}
martinez's avatar
martinez committed
216
      else if (!strcmp(argv[formula_index], "-m"))
martinez's avatar
martinez committed
217
	{
martinez's avatar
martinez committed
218
	  echeck = MagicSearch;
martinez's avatar
martinez committed
219
220
221
222
	  degeneralize_opt = true;
	  expect_counter_example = true;
	  output = -1;
	}
martinez's avatar
martinez committed
223
      else if (!strcmp(argv[formula_index], "-M"))
224
225
226
	{
	  echeck = MagicSearch;
	  degeneralize_opt = true;
martinez's avatar
martinez committed
227
	  expect_counter_example = false;
228
	  output = -1;
martinez's avatar
martinez committed
229
	}
martinez's avatar
martinez committed
230
231
      else if (!strcmp(argv[formula_index], "-n"))
	{
232
	  echeck = MagicSearch;
martinez's avatar
martinez committed
233
234
235
236
237
238
239
240
241
242
	  degeneralize_opt = true;
	  expect_counter_example = true;
	  output = -1;
	  magic_many = true;
	}
      else if (!strcmp(argv[formula_index], "-N"))
	{
	  degeneralize_opt = true;
	  output = 8;
	}
243
244
245
246
247
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
	  fm_opt = true;
	}
248
249
      else if (!strcmp(argv[formula_index], "-r"))
	{
250
251
	  output = 1;
	}
252
253
254
255
256
257
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
258
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
259
260
261
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
262
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
263
264
265
266
267
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
268
269
270
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
271
	}
martinez's avatar
martinez committed
272
273
274
275
276
277
278
279
280
      else if (!strcmp(argv[formula_index], "-R1q"))
	{
	  reduc_aut |= spot::Reduce_quotient_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R1t"))
	{
	  reduc_aut |= spot::Reduce_transition_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R2q"))
281
	{
martinez's avatar
martinez committed
282
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
283
	}
martinez's avatar
martinez committed
284
      else if (!strcmp(argv[formula_index], "-R2t"))
285
	{
martinez's avatar
martinez committed
286
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
      else if (!strcmp(argv[formula_index], "-rd"))
	{
	  display_reduce_form = true;
	}
      else if (!strcmp(argv[formula_index], "-Rd"))
	{
	  display_rel_sim = true;
	}
      else if (!strcmp(argv[formula_index], "-RD"))
	{
	  display_parity_game = true;
	}
304
305
306
307
308
309
310
311
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
312
313
314
315
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
316
317
318
319
320
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
	  fm_opt = true;
	  // Parse -U's argument.
321
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
322
323
324
325
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
326
	      tok = strtok(0, ", \t;");
327
328
	    }
	}
329
330
331
332
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
333
334
335
336
337
      else if (!strcmp(argv[formula_index], "-x"))
	{
	  fm_opt = true;
	  fm_exprop_opt = true;
	}
338
339
340
341
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
342
343
344
345
346
      else if (!strcmp(argv[formula_index], "-y"))
	{
	  fm_opt = true;
	  fm_symb_merge_opt = false;
	}
347
348
349
350
      else
	{
	  break;
	}
351
352
    }

353
354
355
356
  std::string input;

  if (file_opt)
    {
357
      if (strcmp(argv[formula_index], "-"))
358
	{
359
	  std::ifstream fin(argv[formula_index]);
360
	  if (!fin)
361
362
363
364
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
365

366
	  if (!std::getline(fin, input, '\0'))
367
368
369
370
371
372
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
373
	{
374
	  std::getline(std::cin, input, '\0');
375
376
377
378
379
380
381
	}
    }
  else
    {
      input = argv[formula_index];
    }

382
  spot::bdd_dict* dict = new spot::bdd_dict();
383
384
385
386
387
388
389
390
391

  spot::ltl::formula* f = 0;
  if (!from_file)
    {
      spot::ltl::parse_error_list pel;
      f = spot::ltl::parse(input, pel, env, debug_opt);
      exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
    }
  if (f || from_file)
392
    {
393
394
395
396
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

397
398
399
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
400
401
	  spot::tgba_explicit* e;
	  to_free = a = e = spot::tgba_parse(input, pel, dict, env, debug_opt);
402
403
	  if (spot::format_tgba_parse_errors(std::cerr, pel))
	    return 2;
404
	  e->merge_transitions();
405
	}
406
      else
407
	{
408
	  if (redopt != spot::ltl::Reduce_None)
409
	    {
410
411
412
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
	      spot::ltl::destroy(f);
	      f = t;
413
414
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
415
	    }
416

417
	  if (fm_opt)
418
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
419
					       fm_symb_merge_opt,
420
					       post_branching,
421
					       fair_loop_approx, unobservables);
422
423
424
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
425

426
427
428
429
      spot::tgba_tba_proxy* degeneralized = 0;
      if (degeneralize_opt)
	a = degeneralized = new spot::tgba_tba_proxy(a);

430
431
432
433
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
	  a = aut_red = new spot::tgba_reduc(a);
434
435
436
437

	  if (reduc_aut & spot::Reduce_Scc)
	    aut_red->prune_scc();

martinez's avatar
martinez committed
438
439
440
441
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
442
	    {
martinez's avatar
martinez committed
443
444
445
446
447
448
449
450
451
452
453
454
455
	      spot::direct_simulation_relation* rel_dir = 0;
	      spot::delayed_simulation_relation* rel_del = 0;

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			       spot::Reduce_transition_Dir_Sim))
		rel_dir = spot::get_direct_relation_simulation(a,
							       std::cout,
							       display_parity_game);
	      else if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
				    spot::Reduce_transition_Del_Sim))
		rel_del = spot::get_delayed_relation_simulation(a,
								std::cout,
								display_parity_game);
456
457

	      if (display_rel_sim)
martinez's avatar
martinez committed
458
459
460
461
462
463
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
464

martinez's avatar
martinez committed
465
466
467
468
469
470
471
472
473
474
475
476
477
	      if (reduc_aut & spot::Reduce_quotient_Dir_Sim)
		aut_red->quotient_state(rel_dir);
	      if (reduc_aut & spot::Reduce_transition_Dir_Sim)
		aut_red->delete_transitions(rel_dir);
	      if (reduc_aut & spot::Reduce_quotient_Del_Sim)
		aut_red->quotient_state(rel_del);
	      if (reduc_aut & spot::Reduce_transition_Del_Sim)
		aut_red->delete_transitions(rel_del);

	      if (rel_dir)
		spot::free_relation_simulation(rel_dir);
	      if (rel_del)
		spot::free_relation_simulation(rel_del);
478
479
480
	    }
	}

481
482
483
484
485
486
487
488
489
490
491
492
493
      spot::tgba_explicit* expl = 0;
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

494
495
      switch (output)
	{
496
497
498
	case -1:
	  /* No output.  */
	  break;
499
500
501
502
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
503
504
505
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
506
507
	  break;
	case 2:
508
509
510
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
511
				get_core_data().acceptance_conditions);
512
513
	  break;
	case 3:
514
515
516
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
517
518
	  break;
	case 4:
519
520
521
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
522
				get_core_data().acceptance_conditions);
523
	  break;
524
	case 5:
525
	  a->get_dict()->dump(std::cout);
526
	  break;
527
528
529
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
530
531
532
	case 8:
	  spot::never_claim_reachable(std::cout, degeneralized, f);
	  break;
533
534
535
	default:
	  assert(!"unknown output option");
	}
536

537
538
      spot::emptiness_check* ec = 0;
      spot::tgba* ec_a = 0;
539
540
541
542
      switch (echeck)
	{
	case None:
	  break;
martinez's avatar
martinez committed
543

544
	case Couvreur:
545
546
547
548
	  ec_a = a;
	  ec = new spot::couvreur99_check(a);
	  break;

549
	case Couvreur2:
550
551
	  ec_a = a;
	  ec = new spot::couvreur99_check_shy(a);
552
	  break;
martinez's avatar
martinez committed
553

554
	case MagicSearch:
555
556
	  ec_a = degeneralized;
	  ec = new spot::magic_search(degeneralized);
557
	  break;
558
	}
martinez's avatar
martinez committed
559

560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
      if (ec)
	{
	  do
	    {
	      spot::emptiness_check_result* res = ec->check();
	      if (expect_counter_example != !!res)
		exit_code = 1;

	      if (!res)
		{
		  std::cout << "no accepting run found" << std::endl;
		  break;
		}
	      else
		{

		  spot::tgba_run* run = res->accepting_run();
		  if (!run)
		    {
579
		      std::cout << "an accepting run exists" << std::endl;
580
581
582
583
		    }
		  else
		    {
		      spot::print_tgba_run(std::cout, run, ec_a);
584
585
		      // if (!spot::replay_tgba_run(std::cout, ec_a, run))
		      //   exit_code = 1;
586
587
588
589
590
591
592
		      delete run;
		    }
		}
	      delete res;
	    }
	  while (magic_many);
	  delete ec;
martinez's avatar
martinez committed
593
594
	}

595
596
      if (f)
        spot::ltl::destroy(f);
597
598
      if (expl)
	delete expl;
599
600
      if (degeneralize_opt)
	delete degeneralized;
601
602
      if (aut_red)
	delete aut_red;
603

604
      delete to_free;
605
606
607
608
609
610
611
612
613
614
    }
  else
    {
      exit_code = 1;
    }

  assert(spot::ltl::atomic_prop::instance_count() == 0);
  assert(spot::ltl::unop::instance_count() == 0);
  assert(spot::ltl::binop::instance_count() == 0);
  assert(spot::ltl::multop::instance_count() == 0);
615
  delete dict;
616
617
  return exit_code;
}