Joachim Parrow

Available identifiers

zbMath Open parrow.joachimMaRDI QIDQ287321

List of research outcomes

Publication	Date of Publication	Type
Constraints as processes	2023-06-28	Paper
Deciding bisimulation equivalences for a class of non-finite-state programs	2022-08-16	Paper
Weak Nominal Modal Logic	2022-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4995150	2021-06-23	Paper
https://portal.mardi4nfdi.de/entity/Q5856409	2021-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q5150128	2021-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q5357704	2017-09-12	Paper
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)	2016-11-09	Paper
General conditions for full abstraction	2016-07-28	Paper
Higher-order psi-calculi	2016-07-26	Paper
The Largest Respectful Function	2016-07-06	Paper
Psi-calculi in Isabelle	2016-05-26	Paper
The Expressive Power of Monotonic Parallel Composition	2016-04-26	Paper
A sorted semantic framework for applied process calculi	2016-04-19	Paper
Expressiveness of process algebras	2014-01-17	Paper
A completeness proof for bisimulation in the pi-calculus using Isabelle	2014-01-10	Paper
Computing strong and weak bisimulations for psi-calculi	2012-08-14	Paper
Broadcast psi-calculi with an application to wireless protocols	2011-10-28	Paper
Psi-calculi: a framework for mobile processes with nominal data and logic	2011-05-26	Paper
Psi-calculi in Isabelle	2009-10-20	Paper
Formalising the pi-calculus using nominal logic	2009-08-20	Paper
Extended pi-Calculi	2008-08-19	Paper
Formalising the π-Calculus Using Nominal Logic	2007-09-07	Paper
Formal Techniques for Networked and Distributed Systems - FORTE 2005	2006-07-07	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q5714437	2006-01-02	Paper
Formal Techniques for Networked and Distributed Systems – FORTE 2004	2005-08-18	Paper
The \(\pi\)-calculus: An introduction	2002-01-30	Paper
An introduction to the \(\pi\)-calculus.	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4942625	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4219040	1999-02-14	Paper
Algebraic theories for name-passing calculi	1996-05-02	Paper
https://portal.mardi4nfdi.de/entity/Q4763512	1995-04-18	Paper
Deciding bisimulation equivalences for a class of non-finite-state programs	1994-03-24	Paper
Structural and behavioural equivalences of networks	1994-03-24	Paper
https://portal.mardi4nfdi.de/entity/Q4038717	1993-05-18	Paper
An algebraic verification of a mobile network	1993-04-01	Paper
Submodule construction as equation solving in CCS	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3768385	1987-01-01	Paper

Research outcomes over time

This page was built for person: Joachim Parrow