Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Joachim Parrow"'
Autor:
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramūnas Forsberg Gutkovas, Tjark Weber
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)
We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these sys
Externí odkaz:
https://doaj.org/article/771b4fa2af15425eb60b77cb5c255282
Autor:
Johannes Åman Pohjola, Joachim Parrow
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 160, Iss Proc. EXPRESS/SOS 2014, Pp 2-15 (2014)
Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action priorities, where an action can execute only if all other enabled actions have
Externí odkaz:
https://doaj.org/article/2b8c5c713ae64e3d9807ef14e68bc3f1
Autor:
Joachim Parrow, Tjark Weber
Publikováno v:
Logical Methods in Computer Science, Vol Volume 12, Issue 2 (2016)
Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof. In particular the largest respectful function,
Externí odkaz:
https://doaj.org/article/8cac6e3baa62481980bc0defd81e12a0
Publikováno v:
Logical Methods in Computer Science, Vol Volume 12, Issue 1 (2016)
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several suc
Externí odkaz:
https://doaj.org/article/31435ae99f83464183b17bdd7e44f94d
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 18, Iss Proc. SOS 2009, Pp 17-31 (2010)
We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics. A psi-calculus is an extension of the pi-calculus with nom
Externí odkaz:
https://doaj.org/article/fc79f19cac004808b9a107e9cd431e31
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 1 (2011)
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calcu
Externí odkaz:
https://doaj.org/article/13885093b9624d1b8d96acbfcfab5fac
Autor:
Jesper Bengtson, Joachim Parrow
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 2 (2009)
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to
Externí odkaz:
https://doaj.org/article/f787ea8fe60e4bb39c4cd12b3b3abaf8
Publikováno v:
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783319602240
FORTE
FORTE
Previous work on nominal transition systems explores strong bisimulation and a general kind of Hennessy-Milner logic with infinite but finitely supported conjunction, showing that it is remarkably expressive. In the present paper we treat weak bisimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f853908c115c7b99499ca51fa99d4286
https://doi.org/10.1007/978-3-319-60225-7_13
https://doi.org/10.1007/978-3-319-60225-7_13
Autor:
Johannes Åman Pohjola, Joachim Parrow
Publikováno v:
CPP
Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. Remarkably, machine-checked proofs of standard algebraic and congr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a3e3340df1c07d24b6dda46dbec4023
https://doi.org/10.1145/2854065.2854080
https://doi.org/10.1145/2854065.2854080
Publikováno v:
Bengtson, J, Parrow, J & Weber, T 2016, ' Psi-calculi in Isabelle ', Journal of Automated Reasoning, vol. 56, no. 1, 1, pp. 1-47 . https://doi.org/10.1007/s10817-015-9336-2
This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi-calculus, and the spi calculus. Psi-calculi are significantly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0acf834f965ef3612c0fe452dfee9a65
https://pure.itu.dk/portal/da/publications/1b8c5c18-acc0-4241-b6f5-1d281f1fffac
https://pure.itu.dk/portal/da/publications/1b8c5c18-acc0-4241-b6f5-1d281f1fffac