Zobrazeno 1 - 10
of 215
pro vyhledávání: '"Ingolfsdottir, Anna"'
Reactive software calls for instrumentation methods that uphold the reactive attributes of systems. Runtime verification imposes another demand on the instrumentation, namely that the trace event sequences it reports to monitors are sound -- that is,
Externí odkaz:
http://arxiv.org/abs/2406.19904
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the formulae in
Externí odkaz:
http://arxiv.org/abs/2405.13697
Publikováno v:
J. Log. Algebraic Methods Program. Vol. 92. 2017
We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite branching, i
Externí odkaz:
http://arxiv.org/abs/2402.02847
Autor:
Aceto, Luca, Fábregas, Ignacio, García-Pérez, Álvaro, Ingólfsdóttir, Anna, Ortega-Mallén, Yolanda
The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifi
Externí odkaz:
http://arxiv.org/abs/2402.00982
Logical characterisations, rule formats and compositionality for input-output conformance simulation
Input-output conformance simulation (iocos) has been proposed by Gregorio-Rodr\'iguez, Llana and Mart\'inez-Torres as a simulation-based behavioural preorder underlying model-based testing. This relation is inspired by Tretmans' classic ioco relation
Externí odkaz:
http://arxiv.org/abs/2402.00973
Publikováno v:
Theoretical Computer Science vol 777. 2019
In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are ex
Externí odkaz:
http://arxiv.org/abs/2402.00970
Autor:
Aceto, Luca, Fábregas, Ignacio, Escrig, David de Frutos, Ingólfsdóttir, Anna, Palomino, Miguel
Publikováno v:
Science of Computer Programming 78. 2013
This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders
Externí odkaz:
http://arxiv.org/abs/2402.00966
Publikováno v:
EPTCS 387, 2023, pp. 26-40
This position paper on the (meta-)theory of Structural Operational Semantic (SOS) is motivated by the following two questions: (1) Is the (meta-)theory of SOS dying out as a research field? (2) If so, is it possible to rejuvenate this field with a re
Externí odkaz:
http://arxiv.org/abs/2309.07304
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (August 7, 2024) lmcs:11525
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translat
Externí odkaz:
http://arxiv.org/abs/2306.16881
Continuous-time Markov chains (CTMCs) are popular modeling formalism that constitutes the underlying semantics for real-time probabilistic systems such as queuing networks, stochastic process algebras, and calculi for systems biology. Prism and Storm
Externí odkaz:
http://arxiv.org/abs/2302.08588