In this paper we provide a broad investigation of the symbolic approach for solving Parity Games.... more In this paper we provide a broad investigation of the symbolic approach for solving Parity Games. Specifically, we implement in a fresh tool, called SymPGSolver, four symbolic algorithms to solve Parity Games and compare their performances to the corresponding explicit versions for different classes of games. By means of benchmarks, we show that for random games, even for constrained random games, explicit algorithms actually perform better than symbolic algorithms. The situation changes, however, for structured games, where symbolic algorithms seem to have the advantage. This suggests that when evaluating algorithms for parity-game solving, it would be useful to have real benchmarks and not only random benchmarks, as the common practice has been.
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse... more The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable and ExpTime-complete, it has recently been proved that the full calculus is undecidable. In this paper, we study the fragments of the fully enriched μ-calculus that
Automated Technology for Verification and Analysis, 2004
Abstract: We introduce and study three notions of typeness for automata on infinite words. For an... more Abstract: We introduce and study three notions of typeness for automata on infinite words. For an acceptance-condition class # (that is, # is weak, Buchi, coB uchi, Rabin, or Streett), deterministic #-typeness asks for the existence of an equivalent #-automaton on the same deterministic structure, nondeterministic #- typeness asks for the existence of an equivalent #-automaton on the same structure,
We consider two-player games played on finite colored graphs where the goal is the construction o... more We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path, or (iii) all
Troppo spesso la scuola appare distante dagli alunni, ancorata a contenuti che sembrano scarsamen... more Troppo spesso la scuola appare distante dagli alunni, ancorata a contenuti che sembrano scarsamente applicabili e a metodi di insegnamento che producono scarsi risultati, perch? non sono in grado di integrarsi con il linguaggio della societ? digitale in cui viviamo. Questo contributo, realizzato nell'ambito del progetto INNOVASCUOLA promosso dal Dipartimento per l'Innovazione e il Ministero dell'Istruzione, dell'Universit? e della Ricerca, propone un approccio innovativo interdisciplinare per l'insegnamento delle scienze naturali, della matematica e dell'informatica nella scuola secondaria di primo grado attraverso un percorso didattico unificato nel quale gli esperimenti di scienze rappresentano la base per applicare semplici regole matematiche e per utilizzare semplici strumenti informatici.
In scholar curriculum, the integration of contents from different learning areas has been always ... more In scholar curriculum, the integration of contents from different learning areas has been always a chal- lenging issue, but with very few practical experimenta- tions. This paper reports an experimental project of teaching natural science, mathematics, and computer science (technology education) in the first level of the Italian secondary school, by means of a common inte- grate path based on practical experiments. We show effectiveness of the conceived interdisciplinary ap- proach by means of a case study in a network of thirty classrooms of 11 years old scholars.
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operation... more Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the in- put. In this paper, we consider VPA with two stacks, namely 2-VPA. These automata introduce a useful model to eectively describe con- current pushdown systems using a simple communication mechanism between stacks. We show that 2-VPA are strictly more expressive
ICALP is a series of annual conferences organised by the European Association for Theoretical Com... more ICALP is a series of annual conferences organised by the European Association for Theoretical Computer Science (EATCS), whose first edition took place in 1972. In 2006, the ICALP programme run three parallel tracks: A, focusing on algorithms, automata, complexity and games (chaired by the late I. Wegener); B, focusing on logic, semantics and theory of programming (chaired by V. Sassone); and C, focusing on security and cryptography foundation (chaired by B. Preneel). In response to the call for papers, the Program ...
In this paper we provide a broad investigation of the symbolic approach for solving Parity Games.... more In this paper we provide a broad investigation of the symbolic approach for solving Parity Games. Specifically, we implement in a fresh tool, called SymPGSolver, four symbolic algorithms to solve Parity Games and compare their performances to the corresponding explicit versions for different classes of games. By means of benchmarks, we show that for random games, even for constrained random games, explicit algorithms actually perform better than symbolic algorithms. The situation changes, however, for structured games, where symbolic algorithms seem to have the advantage. This suggests that when evaluating algorithms for parity-game solving, it would be useful to have real benchmarks and not only random benchmarks, as the common practice has been.
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse... more The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable and ExpTime-complete, it has recently been proved that the full calculus is undecidable. In this paper, we study the fragments of the fully enriched μ-calculus that
Automated Technology for Verification and Analysis, 2004
Abstract: We introduce and study three notions of typeness for automata on infinite words. For an... more Abstract: We introduce and study three notions of typeness for automata on infinite words. For an acceptance-condition class # (that is, # is weak, Buchi, coB uchi, Rabin, or Streett), deterministic #-typeness asks for the existence of an equivalent #-automaton on the same deterministic structure, nondeterministic #- typeness asks for the existence of an equivalent #-automaton on the same structure,
We consider two-player games played on finite colored graphs where the goal is the construction o... more We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path, or (iii) all
Troppo spesso la scuola appare distante dagli alunni, ancorata a contenuti che sembrano scarsamen... more Troppo spesso la scuola appare distante dagli alunni, ancorata a contenuti che sembrano scarsamente applicabili e a metodi di insegnamento che producono scarsi risultati, perch? non sono in grado di integrarsi con il linguaggio della societ? digitale in cui viviamo. Questo contributo, realizzato nell'ambito del progetto INNOVASCUOLA promosso dal Dipartimento per l'Innovazione e il Ministero dell'Istruzione, dell'Universit? e della Ricerca, propone un approccio innovativo interdisciplinare per l'insegnamento delle scienze naturali, della matematica e dell'informatica nella scuola secondaria di primo grado attraverso un percorso didattico unificato nel quale gli esperimenti di scienze rappresentano la base per applicare semplici regole matematiche e per utilizzare semplici strumenti informatici.
In scholar curriculum, the integration of contents from different learning areas has been always ... more In scholar curriculum, the integration of contents from different learning areas has been always a chal- lenging issue, but with very few practical experimenta- tions. This paper reports an experimental project of teaching natural science, mathematics, and computer science (technology education) in the first level of the Italian secondary school, by means of a common inte- grate path based on practical experiments. We show effectiveness of the conceived interdisciplinary ap- proach by means of a case study in a network of thirty classrooms of 11 years old scholars.
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operation... more Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the in- put. In this paper, we consider VPA with two stacks, namely 2-VPA. These automata introduce a useful model to eectively describe con- current pushdown systems using a simple communication mechanism between stacks. We show that 2-VPA are strictly more expressive
ICALP is a series of annual conferences organised by the European Association for Theoretical Com... more ICALP is a series of annual conferences organised by the European Association for Theoretical Computer Science (EATCS), whose first edition took place in 1972. In 2006, the ICALP programme run three parallel tracks: A, focusing on algorithms, automata, complexity and games (chaired by the late I. Wegener); B, focusing on logic, semantics and theory of programming (chaired by V. Sassone); and C, focusing on security and cryptography foundation (chaired by B. Preneel). In response to the call for papers, the Program ...
Uploads
Papers by Aniello Murano