Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Castiglioni, Valentina"'
We propose the Robustness Temporal Logic (RobTL), a novel temporal logic for the specification and analysis of distances between the behaviours of Cyber-Physical Systems (CPSs) over a finite time horizon. Differently from classical temporal logic exp
Externí odkaz:
http://arxiv.org/abs/2212.11158
Publikováno v:
EPTCS 368, 2022
This volume contains the proceedings of EXPRESS/SOS 2022: the Combined 29th International Workshop on Expressiveness in Concurrency and the 19th Workshop on Structural Operational Semantics, which was held in Warsaw, Poland, as an affiliated workshop
Externí odkaz:
http://arxiv.org/abs/2208.14777
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from internal c
Externí odkaz:
http://arxiv.org/abs/2206.13927
The behaviour of systems characterised by a closed interaction of software components with the environment is inevitably subject to perturbations and uncertainties. In this paper we propose a general framework for the specification and verification o
Externí odkaz:
http://arxiv.org/abs/2204.13357
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 3 (July 7, 2023) lmcs:8780
Due to the diffusion of IoT, modern software systems are often thought to control and coordinate smart devices in order to manage assets and resources, and to guarantee efficient behaviours. For this class of systems, which interact extensively with
Externí odkaz:
http://arxiv.org/abs/2111.15319
Autor:
Dardha, Ornela, Castiglioni, Valentina
Publikováno v:
EPTCS 339, 2021
This volume contains the proceedings of EXPRESS/SOS 2021: the Combined 28th International Workshop on Expressiveness in Concurrency and the 18th Workshop on Structural Operational Semantics, which was held online, as an affiliated workshop of CONCUR
Externí odkaz:
http://arxiv.org/abs/2108.09624
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss the soluti
Externí odkaz:
http://arxiv.org/abs/2105.00735
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming February 2024 137
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (January 19, 2022) lmcs:7217
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 B
Externí odkaz:
http://arxiv.org/abs/2102.11166
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation
Externí odkaz:
http://arxiv.org/abs/2010.01943