Zobrazeno 1 - 10
of 137
pro vyhledávání: '"Aniello Murano"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 235-249 (2018)
The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-f
Externí odkaz:
https://doaj.org/article/87dfc58fa7ad4a199dcf971ebc46941c
Autor:
Laura Bozzelli, Aniello Murano
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 256, Iss Proc. GandALF 2017, Pp 268-282 (2017)
Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment. Classically, module checking has been investigated with respect to specifications given
Externí odkaz:
https://doaj.org/article/8a7788347ecb4e1eadf011a8c8fdf92a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 164-177 (2016)
Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these kind of probl
Externí odkaz:
https://doaj.org/article/9656c29e2b4c4327b5a22ff7a6bbb9c2
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 218, Iss Proc. SR 2016, Pp 1-14 (2016)
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy Logic (Gr
Externí odkaz:
https://doaj.org/article/5d362ddfea524a1ba9acfde4667cddc8
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 1 (2017)
Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, subs
Externí odkaz:
https://doaj.org/article/4dae516fb8ab48139955369644afaabb
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 28, Iss Proc. QAPL 2010, Pp 48-63 (2010)
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 const
Externí odkaz:
https://doaj.org/article/e87e732c78e548ff92edfb3acd92ef7b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)
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 a
Externí odkaz:
https://doaj.org/article/f6b6cc73cb564a52aa375359579cb308
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)
The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investi
Externí odkaz:
https://doaj.org/article/23fb84ae48094561926c0ddfc36b1c3e
Autor:
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Publikováno v:
ACM Transactions on Computational Logic. 24:1-38
Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a58b84d100a212bf8dfa00f77b42ef5
https://doi.org/10.1145/3582498
https://doi.org/10.1145/3582498
Publikováno v:
Annals of Mathematics and Artificial Intelligence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ce18e9005f12ede37e2978d37c62605
https://doi.org/10.1007/s10472-023-09852-3
https://doi.org/10.1007/s10472-023-09852-3