Publication | Date of Publication | Type |
---|
Building international doctoral schools in computer science in Italy, De Nicola's way | 2024-02-23 | Paper |
Testing equivalence vs. runtime monitoring | 2024-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q6191004 | 2024-02-08 | Paper |
On first-order runtime enforcement of branching-time properties | 2023-11-21 | Paper |
On relating concurrency and nondeterminism | 2023-08-16 | Paper |
On probabilistic monitorability | 2023-08-10 | Paper |
Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction | 2023-07-26 | Paper |
Termination, deadlock and divergence | 2023-04-12 | Paper |
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties | 2023-03-22 | Paper |
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? | 2022-12-08 | Paper |
Monitoring hyperproperties with circuits | 2022-08-19 | Paper |
CPO models for a class of GSOS languages | 2022-08-18 | Paper |
CONCUR Test-of-time award 2020 announcement | 2022-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5089283 | 2022-07-18 | Paper |
Axiomatizing recursion-free, regular monitors | 2022-05-25 | Paper |
On bidirectional runtime enforcement | 2022-03-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5028469 | 2022-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5009452 | 2021-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4992502 | 2021-06-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5854734 | 2021-03-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4965820 | 2021-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4965855 | 2021-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5150127 | 2021-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5146592 | 2021-01-26 | Paper |
Monitoring for Silent Actions | 2020-11-25 | Paper |
On the axiomatisability of priority. III: Priority strikes again | 2020-08-25 | Paper |
Coverability Synthesis in Parametric Petri Nets | 2020-05-27 | Paper |
The complexity of identifying characteristic formulae | 2020-04-15 | Paper |
Determinizing monitors for HML with recursion | 2020-01-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q5207887 | 2020-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4972733 | 2019-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4967213 | 2019-07-03 | Paper |
Logical characterisations, rule formats and compositionality for input-output conformance simulation | 2019-06-20 | Paper |
When are prime formulae characteristic? | 2019-06-18 | Paper |
A framework for parameterized monitorability | 2018-07-17 | Paper |
A unified rule format for bounded nondeterminism in SOS with terms as labels | 2017-09-12 | Paper |
Monitorability for the Hennessy-Milner logic with recursion | 2017-09-08 | Paper |
Trace Simulation Semantics is not Finitely Based over BCCSP | 2017-08-25 | Paper |
On the complexity of determinizing monitors | 2017-08-22 | Paper |
A finite equational base for CCS with left merge and communication merge | 2017-07-12 | Paper |
Logical Characterisations and Compositionality of Input-Output Conformance Simulation | 2017-04-04 | Paper |
A characterization of finitary bisimulation | 2016-05-26 | Paper |
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases | 2016-04-07 | Paper |
Rule Formats for Bounded Nondeterminism in Structural Operational Semantics | 2016-03-23 | Paper |
Compositional Reasoning for Multi-modal Logics | 2015-12-11 | Paper |
When Are Prime Formulae Characteristic? | 2015-09-16 | Paper |
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems | 2015-07-10 | Paper |
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders | 2015-01-14 | Paper |
A ground-complete axiomatization of stateless bisimilarity over Linda | 2014-12-09 | Paper |
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators | 2014-11-04 | Paper |
Axiomatizing weak simulation semantics over BCCSP | 2014-06-10 | Paper |
The algorithmics of bisimilarity | 2014-04-25 | Paper |
SOS rule formats for idempotent terms and idempotent unary operators | 2014-02-25 | Paper |
An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics | 2014-01-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2863902 | 2013-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q2847402 | 2013-09-09 | Paper |
Resource bisimilarity and graded bisimilarity coincide | 2013-04-04 | Paper |
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet | 2013-03-28 | Paper |
Algebraic Synchronization Trees and Processes | 2012-11-01 | Paper |
Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations | 2012-06-29 | Paper |
The Equational Theory of Weak Complete Simulation Semantics over BCCSP | 2012-06-15 | Paper |
Characteristic formulae for fixed-point semantics: a general framework | 2012-05-11 | Paper |
Proving the validity of equations in GSOS languages using rule-matching bisimilarity | 2012-05-11 | Paper |
Axiomatizing Weak Ready Simulation Semantics over BCCSP | 2012-01-06 | Paper |
PREG Axiomatizer – A Ground Bisimilarity Checker for GSOS with Predicates | 2011-09-02 | Paper |
On the axiomatizability of priority. II | 2011-07-07 | Paper |
Equational Axioms for Probabilistic Bisimilarity | 2011-05-06 | Paper |
The equational theory of prebisimilarity over basic CCS with divergence | 2010-06-09 | Paper |
On the expressibility of priority | 2010-06-09 | Paper |
Theoretical Computer Science | 2010-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3396605 | 2009-09-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3396642 | 2009-09-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3395976 | 2009-09-15 | Paper |
A note on an expressiveness hierarchy for multi-exit iteration | 2009-04-28 | Paper |
Ready to Preorder: Get Your BCCSP Axiomatization for Free! | 2009-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3601881 | 2009-02-12 | Paper |
The Saga of the Axiomatization of Parallel Composition | 2008-09-18 | Paper |
On the axiomatisability of priority | 2008-04-10 | Paper |
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge | 2007-10-11 | Paper |
Reactive Systems | 2007-10-04 | Paper |
On the Axiomatizability of Priority | 2007-09-11 | Paper |
A Finite Equational Base for CCS with Left Merge and Communication Merge | 2007-09-11 | Paper |
Bisimilarity is not finitely based over BPA with interrupt | 2007-01-09 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
Algebra and Coalgebra in Computer Science | 2006-10-20 | Paper |
CPO models for compact GSOS languages | 2006-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4665737 | 2005-04-11 | Paper |
CCS with Hennessy's merge has no finite-equational axiomatization | 2005-02-22 | Paper |
Nested semantics over finite trees are equationally hard | 2004-08-06 | Paper |
A Fully Equational Proof of Parikh's Theorem | 2003-11-20 | Paper |
The power of reachability testing for timed automata | 2003-07-30 | Paper |
Equational theories of tropical semirings | 2003-05-25 | Paper |
The max-plus algebra of the natural numbers has no finite equational basis | 2003-05-14 | Paper |
Is your model checker on time? On the complexity of model checking for timed modal logics | 2003-02-13 | Paper |
Corrigendum: ``A domain equation for bisimulation by S. Abramsky | 2003-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2769423 | 2002-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2762495 | 2002-01-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2736337 | 2001-08-29 | Paper |
Characteristic Formulae for Timed Automata | 2001-07-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4501538 | 2001-02-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q2760240 | 2001-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4790410 | 2001-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4940887 | 2000-04-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4941895 | 2000-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4260699 | 1999-09-01 | Paper |
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces | 1999-03-22 | Paper |
A complete equational axiomatization for MPA with string iteration | 1999-01-12 | Paper |
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based | 1999-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222907 | 1998-12-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q3839065 | 1998-10-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4375631 | 1998-05-10 | Paper |
An equational axiomatization for multi-exit iteration | 1998-02-16 | Paper |
A complete axiomatization of timed bisimulation for a class of timed regular behaviours | 1997-02-27 | Paper |
Axiomatizing prefix iteration with silent steps | 1996-11-25 | Paper |
Timing and causality in process algebra | 1996-10-27 | Paper |
On “Axiomatising Finite Concurrent Processes” | 1995-03-20 | Paper |
Adding action refinement to a finite process algebra | 1995-02-16 | Paper |
A static view of localities | 1995-02-13 | Paper |
GSOS and finite labelled transition systems | 1994-08-29 | Paper |
Termination, deadlock, and divergence | 1994-08-21 | Paper |
Turning SOS rules into equations | 1994-06-19 | Paper |
Towards action-refinement in process algebras | 1993-06-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036589 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4023588 | 1993-01-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4015485 | 1993-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4015488 | 1993-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3204033 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3030238 | 1987-01-01 | Paper |