134 research outputs found
Meta SOS - A Maude Based SOS Meta-Theory Framework
Meta SOS is a software framework designed to integrate the results from the
meta-theory of structural operational semantics (SOS). These results include
deriving semantic properties of language constructs just by syntactically
analyzing their rule-based definition, as well as automatically deriving sound
and ground-complete axiomatizations for languages, when considering a notion of
behavioural equivalence. This paper describes the Meta SOS framework by
blending aspects from the meta-theory of SOS, details on their implementation
in Maude, and running examples.Comment: In Proceedings EXPRESS/SOS 2013, arXiv:1307.690
An axiomatization of verdict equivalence over regular monitors
Monitors are a key tool in the field of runtime verification, where they are
used to check for system properties by analysing execution traces generated by
processes. Work on runtime monitoring carried out in a series of papers by
Aceto et al. has specified monitors using a variation on the regular fragment
of Milner's CCS and studied two trace-based notions of equivalence over
monitors, namely verdict and -verdict equivalence. This article is
devoted to the study of the equational logic of monitors modulo those two
notions of equivalence. It presents complete equational axiomatizations of
verdict and -verdict equivalence for closed and open terms over
recursion-free monitors.Comment: Preprint submitted to Journal of logical and algebraic methods in
programing 202
On the Axiomatisability of Parallel Composition
This paper studies the existence of finite equational axiomatisations of the
interleaving parallel composition operator modulo the behavioural equivalences
in van Glabbeek's linear time-branching time spectrum. In the setting of the
process algebra BCCSP over a finite set of actions, we provide finite,
ground-complete axiomatisations for various simulation and (decorated) trace
semantics. We also show that no congruence over BCCSP that includes
bisimilarity and is included in possible futures equivalence has a finite,
ground-complete axiomatisation; this negative result applies to all the nested
trace and nested simulation semantics
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
Runtime enforcement is a dynamic analysis technique that instruments a
monitor with a system in order to ensure its correctness as specified by some
property. This paper explores bidirectional enforcement strategies for
properties describing the input and output behaviour of a system. We develop an
operational framework for bidirectional enforcement and use it to study the
enforceability of the safety fragment of Hennessy-Milner logic with recursion
(sHML). We provide an automated synthesis function that generates correct
monitors from sHML formulas, and show that this logic is enforceable via a
specific type of bidirectional enforcement monitors called action disabling
monitors
On the Axiomatisability of Parallel Composition
This paper studies the existence of finite equational axiomatisations of the
interleaving parallel composition operator modulo the behavioural equivalences
in van Glabbeek's linear time-branching time spectrum. In the setting of the
process algebra BCCSP over a finite set of actions, we provide finite,
ground-complete axiomatisations for various simulation and (decorated) trace
semantics. We also show that no congruence over BCCSP that includes
bisimilarity and is included in possible futures equivalence has a finite,
ground-complete axiomatisation; this negative result applies to all the nested
trace and nested simulation semantics
On the complexity of determinizing monitors
We examine the determinization of monitors. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form.peer-reviewe
Rule Formats for Nominal Process Calculi
Publisher's version (útgefin grein)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 specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specifications of the early and late pi-calculus. We also explore alternative specifications of the NTSs in which we allow residuals of abstraction sort, and introduce translations between the systems with and without residuals of abstraction sort. Our study stems from the Nominal SOS of Cimini et al. and from earlier works in nominal sets and nominal logic by Gabbay, Pitts and their collaborators.Research partially supported by the project Nominal SOS (nr. 141558-051) of the Icelandic Research Fund, the project 001-ABEL-CM-2013 within the NILS Science and Sustainability Programme, the Spanish Projects TRACES (TIN2015-67522-C3-3-R) and Bosco (PGC2018-102210-B-I00), and by Comunidad de Madrid as part of the program S2018/TCS-4339 (BLOQUES-CM) co-funded by EIE Funds of the European Union, and the projects RACCOON (H2020-EU 714729) and MATHADOR (COGS 724.464) of the European Research Council, and the Spanish addition to MATHADOR (TIN2016-81699-ERC)."Peer Reviewed
Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca
In this paper we propose an extension of the Rebeca language that can be used
to model distributed and asynchronous systems with timing constraints. We
provide the formal semantics of the language using Structural Operational
Semantics, and show its expressiveness by means of examples. We developed a
tool for automated translation from timed Rebeca to the Erlang language, which
provides a first implementation of timed Rebeca. We can use the tool to set the
parameters of timed Rebeca models, which represent the environment and
component variables, and use McErlang to run multiple simulations for different
settings. Timed Rebeca restricts the modeller to a pure asynchronous
actor-based paradigm, where the structure of the model represents the service
oriented architecture, while the computational model matches the network
infrastructure. Simulation is shown to be an effective analysis support,
specially where model checking faces almost immediate state explosion in an
asynchronous setting.Comment: In Proceedings FOCLASA 2011, arXiv:1107.584
- …