Games for counting abstractions

Electronic Notes in Theoretical Computer Science

Volumn 128, Issue 6, 2005, Pages 69-85

  Raskin, J F ^a   Samuelides, M ^b   Van Begin, L ^b  

^a FREE UNIVERSITY OF BRUSSELS   (Belgium)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Counting Abstraction; Games; Petri nets

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; OPEN SYSTEMS; PETRI NETS; PROBLEM SOLVING; STRATEGIC PLANNING;

BROADCAST PROTOCOLS; COUNTING ABSTRACTIONS; COVERABILITY PROBLEMS; GAMES;

COMPUTER SCIENCE;

EID: 18744399549     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.04.005     Document Type: Conference Paper

References (15)

1. P.A. Abdulla, A. Bouajjani, and J. d'Orso Deciding monotonic games Proc. of CSL'03 LNCS 2803 2003 Springer Verlag
2. P.A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay General Decidability Theorems for Infinite-state Systems Proc. of LICS'96 1996 IEEE Computer Society Press 313 321
3. R. Alur, and D.L. Dill A theory of timed automata Theoretical Computer Science 126 1994 183 235
4. L. de Alfaro, T.A. Henzinger, and R. Majumdar Symbolic algorithms for infinite-state games Proc. of CONCUR'01 LNCS 2154 2001 Springer-Verlag 536 550
5. C. Dufourd. Réseaux de Petri avec reset/transfert: Décidabilité et indécidabilité. PhD thesis, ENS de Cachan, 1998
6. A. Finkel, and P. Schnoebelen Well-structured transition systems everywhere! Theoretical Computer Science 256 1-2 2001 63 92
7. D. Gale, and F.M. Stewart Infinite Games with Perfect Information Contribution of the Theory Game II Annals of Mathematics Studies 28 1953 245 266
8. S.M. German, and A.P. Sistla Reasoning about Systems with Many Processes Journal of ACM 39 3 1992 675 735
9. G. Higman Ordering by divisibility in abstract algebras Proc. of the London Mathematical Society 3 2 1952 326 336
10. N.M. Minsky Finite and Infinite Machines 1967 Prentice-Hall Englewood Cliffs, N.J.
11. O. Maler, A. Pnueli, and J. Sifakis On the synthesis of discrete controllers for timed systems Proc. of STACS'95 LNCS 900 1995 229 242
12. M. Samuelides Jeux dans un réseau de Petri Mémoire de DEA 2003 Ecole Normale Suprieure de Cachan France
13. J.-F. Raskin, M. Samuelides, L. Van Begin. Petri games are monotonic but difficult to decide. Technical report 508, Université Libre de Bruxelles, Belgium
14. L. Van Begin Efficient Verification of Counting Abstractions for Parametric Systems. Ph.D. thesis, Université Libre de Bruxelles, 2003
15. I. Walukiewicz Pushdown processes: games and model checking Proc. of CAV'96 LNCS 1102 1996 62 75