Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Behavioural Equivalence"'
Publikováno v:
Software, Vol 3, Iss 3, Pp 284-309 (2024)
Petri nets are a graphical notation for describing a class of discrete event dynamic systems whose behaviours are characterised by concurrency, synchronisation, mutual exclusion and conflict. They have been used over the years for the modelling of va
Externí odkaz:
https://doaj.org/article/5e38178665524768b4577a2020c91e5e
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, In press, ⟨10.1016/j.tcs.2022.01.043⟩
Theoretical Computer Science, In press, ⟨10.1016/j.tcs.2022.01.043⟩
We study Milner's encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus. We show that, by tuning the encoding to two subcalculi of the $\pi$-calculus (Internal $\pi$ and Asynchronous Local $\pi$), the equivalence on $\lambda$-terms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::443a4617b436e57ed028379aa3048109
https://hal.archives-ouvertes.fr/hal-03466150
https://hal.archives-ouvertes.fr/hal-03466150
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
31st International Conference on Concurrency Theory (CONCUR2020), 8:1-8:20
STARTPAGE=8:1;ENDPAGE=8:20;TITLE=31st International Conference on Concurrency Theory (CONCUR2020)
STARTPAGE=8:1;ENDPAGE=8:20;TITLE=31st International Conference on Concurrency Theory (CONCUR2020)
This article improves the time bound for calculating the weak/branching bisimulation minimisation quotient on state-labelled discrete-time Markov chains from O(m n) to an expected-time O(m log4 n), where n is the number of states and m the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de5d452cbdde17c3b095b7c41418d57f
https://research.tue.nl/nl/publications/b61095dc-c86e-497d-9fef-8ffc97a4188f
https://research.tue.nl/nl/publications/b61095dc-c86e-497d-9fef-8ffc97a4188f
Autor:
Gazda, Maciej, Mousavi, Mohammad Reza
Logical characterisation of a behavioural equivalence relation precisely specifies the set of formulae that are preserved and reflected by the relation. Such characterisations have been studied extensively for exact semantics on discrete models such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49c83c4279425bbcfd9ec7a446830f88
Publikováno v:
Biomedical Engineering Systems and Technologies ISBN: 9783030291952
BIOSTEC (Selected Papers)
Communications in Computer and Information Science book series, extended selected paper from Biomedical Engineering Systems and Technologies conference (BIOSTEC 2018)
SPRINGER. Communications in Computer and Information Science book series, extended selected paper from Biomedical Engineering Systems and Technologies conference (BIOSTEC 2018), pp.167-191, 2019, ⟨10.1007/978-3-030-29196-9_10⟩
BIOSTEC (Selected Papers)
Communications in Computer and Information Science book series, extended selected paper from Biomedical Engineering Systems and Technologies conference (BIOSTEC 2018)
SPRINGER. Communications in Computer and Information Science book series, extended selected paper from Biomedical Engineering Systems and Technologies conference (BIOSTEC 2018), pp.167-191, 2019, ⟨10.1007/978-3-030-29196-9_10⟩
International audience; We firstly define an improved version of the spiking neuron model with dendrites introduced in [8] and we focus here on the fundamental mathematical properties of the framework. Our main result is that, under few simplificatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da3c23c0ec07eaae5a9d8f149fb0c29b
https://doi.org/10.1007/978-3-030-29196-9_10
https://doi.org/10.1007/978-3-030-29196-9_10
We study the equivalence of models that capture the behaviour of systems, such as process-oriented information systems. We focus on models that are not related by a bijection over their actions, but by an alignment between sets of their actions. For
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e821a6f8a872884c07531a6ece31ad96
https://zenodo.org/record/5560510
https://zenodo.org/record/5560510
Publikováno v:
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209152⟩
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
LICS
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 18
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science -LICS '18
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209152⟩
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
LICS
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 18
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science -LICS '18
We study Milner's encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus. We show that, by tuning the encoding to two subcalculi of the $\pi$-calculus (Internal $\pi$ and Asynchronous Local $\pi$), the equivalence on $\lambda$-terms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee919f3746b91446332633256ad2fd65
https://hal.archives-ouvertes.fr/hal-01917255
https://hal.archives-ouvertes.fr/hal-01917255
Autor:
Carla Piazza, Alberto Casagrande
Publikováno v:
Theoretical Computer Science. 587:26-48
Unwinding conditions have been fruitfully exploited in Information Flow Security to define persistent security properties. In this paper we investigate their meaning and possible uses in the analysis of biological systems. In particular, we elaborate