Luca Aceto

From MaRDI portal
Revision as of 04:34, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:266855

Available identifiers

zbMath Open aceto.lucaDBLPa/LucaAcetoWikidataQ62090445 ScholiaQ62090445MaRDI QIDQ266855

List of research outcomes





PublicationDate of PublicationType
Complexity results for modal logic with recursion via translations and tableaux2024-09-04Paper
On the axiomatisation of branching bisimulation congruence over CCS2024-08-13Paper
An Operational Guide to Monitorability2024-03-14Paper
Building international doctoral schools in computer science in Italy, De Nicola's way2024-02-23Paper
Testing equivalence vs. runtime monitoring2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61910042024-02-08Paper
On first-order runtime enforcement of branching-time properties2023-11-21Paper
On relating concurrency and nondeterminism2023-08-16Paper
On probabilistic monitorability2023-08-10Paper
Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction2023-07-26Paper
Termination, deadlock and divergence2023-04-12Paper
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties2023-03-22Paper
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?2022-12-08Paper
Monitoring hyperproperties with circuits2022-08-19Paper
CPO models for a class of GSOS languages2022-08-18Paper
CONCUR Test-of-time award 2020 announcement2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50892832022-07-18Paper
Axiomatizing recursion-free, regular monitors2022-05-25Paper
On bidirectional runtime enforcement2022-03-21Paper
https://portal.mardi4nfdi.de/entity/Q50284692022-02-09Paper
https://portal.mardi4nfdi.de/entity/Q50094522021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q49925022021-06-09Paper
https://portal.mardi4nfdi.de/entity/Q58547342021-03-17Paper
https://portal.mardi4nfdi.de/entity/Q49658202021-03-10Paper
https://portal.mardi4nfdi.de/entity/Q49658552021-03-10Paper
https://portal.mardi4nfdi.de/entity/Q51501272021-02-09Paper
https://portal.mardi4nfdi.de/entity/Q51465922021-01-26Paper
Monitoring for Silent Actions2020-11-25Paper
On the axiomatisability of priority. III: Priority strikes again2020-08-25Paper
Coverability Synthesis in Parametric Petri Nets2020-05-27Paper
The complexity of identifying characteristic formulae2020-04-15Paper
Determinizing monitors for HML with recursion2020-01-31Paper
https://portal.mardi4nfdi.de/entity/Q52078872020-01-13Paper
https://portal.mardi4nfdi.de/entity/Q49727332019-11-26Paper
https://portal.mardi4nfdi.de/entity/Q49672132019-07-03Paper
Logical characterisations, rule formats and compositionality for input-output conformance simulation2019-06-20Paper
When are prime formulae characteristic?2019-06-18Paper
A framework for parameterized monitorability2018-07-17Paper
A unified rule format for bounded nondeterminism in SOS with terms as labels2017-09-12Paper
Monitorability for the Hennessy-Milner logic with recursion2017-09-08Paper
Trace Simulation Semantics is not Finitely Based over BCCSP2017-08-25Paper
On the complexity of determinizing monitors2017-08-22Paper
A finite equational base for CCS with left merge and communication merge2017-07-12Paper
Logical Characterisations and Compositionality of Input-Output Conformance Simulation2017-04-04Paper
A characterization of finitary bisimulation2016-05-26Paper
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases2016-04-07Paper
Rule Formats for Bounded Nondeterminism in Structural Operational Semantics2016-03-23Paper
Compositional Reasoning for Multi-modal Logics2015-12-11Paper
When Are Prime Formulae Characteristic?2015-09-16Paper
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems2015-07-10Paper
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders2015-01-14Paper
A ground-complete axiomatization of stateless bisimilarity over Linda2014-12-09Paper
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators2014-11-04Paper
Axiomatizing weak simulation semantics over BCCSP2014-06-10Paper
The algorithmics of bisimilarity2014-04-25Paper
SOS rule formats for idempotent terms and idempotent unary operators2014-02-25Paper
An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics2014-01-17Paper
https://portal.mardi4nfdi.de/entity/Q28639022013-12-04Paper
https://portal.mardi4nfdi.de/entity/Q28474022013-09-09Paper
Resource bisimilarity and graded bisimilarity coincide2013-04-04Paper
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet2013-03-28Paper
Algebraic Synchronization Trees and Processes2012-11-01Paper
Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations2012-06-29Paper
The Equational Theory of Weak Complete Simulation Semantics over BCCSP2012-06-15Paper
Characteristic formulae for fixed-point semantics: a general framework2012-05-11Paper
Proving the validity of equations in GSOS languages using rule-matching bisimilarity2012-05-11Paper
Axiomatizing Weak Ready Simulation Semantics over BCCSP2012-01-06Paper
PREG Axiomatizer – A Ground Bisimilarity Checker for GSOS with Predicates2011-09-02Paper
On the axiomatizability of priority. II2011-07-07Paper
Equational Axioms for Probabilistic Bisimilarity2011-05-06Paper
The equational theory of prebisimilarity over basic CCS with divergence2010-06-09Paper
On the expressibility of priority2010-06-09Paper
Theoretical Computer Science2010-02-23Paper
https://portal.mardi4nfdi.de/entity/Q33966052009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33966422009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33959762009-09-15Paper
A note on an expressiveness hierarchy for multi-exit iteration2009-04-28Paper
Ready to Preorder: Get Your BCCSP Axiomatization for Free!2009-03-10Paper
https://portal.mardi4nfdi.de/entity/Q36018812009-02-12Paper
The Saga of the Axiomatization of Parallel Composition2008-09-18Paper
On the axiomatisability of priority2008-04-10Paper
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge2007-10-11Paper
Reactive Systems2007-10-04Paper
On the Axiomatizability of Priority2007-09-11Paper
A Finite Equational Base for CCS with Left Merge and Communication Merge2007-09-11Paper
Bisimilarity is not finitely based over BPA with interrupt2007-01-09Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
Algebra and Coalgebra in Computer Science2006-10-20Paper
CPO models for compact GSOS languages2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q46657372005-04-11Paper
CCS with Hennessy's merge has no finite-equational axiomatization2005-02-22Paper
Nested semantics over finite trees are equationally hard2004-08-06Paper
A Fully Equational Proof of Parikh's Theorem2003-11-20Paper
The power of reachability testing for timed automata2003-07-30Paper
Equational theories of tropical semirings2003-05-25Paper
The max-plus algebra of the natural numbers has no finite equational basis2003-05-14Paper
Is your model checker on time? On the complexity of model checking for timed modal logics2003-02-13Paper
Corrigendum: ``A domain equation for bisimulation by S. Abramsky2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27694232002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27624952002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27363372001-08-29Paper
Characteristic Formulae for Timed Automata2001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q45015382001-02-16Paper
https://portal.mardi4nfdi.de/entity/Q27602402001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904102001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49408872000-04-06Paper
https://portal.mardi4nfdi.de/entity/Q49418952000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42606991999-09-01Paper
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces1999-03-22Paper
A complete equational axiomatization for MPA with string iteration1999-01-12Paper
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42229071998-12-21Paper
https://portal.mardi4nfdi.de/entity/Q38390651998-10-08Paper
https://portal.mardi4nfdi.de/entity/Q43756311998-05-10Paper
An equational axiomatization for multi-exit iteration1998-02-16Paper
A complete axiomatization of timed bisimulation for a class of timed regular behaviours1997-02-27Paper
Axiomatizing prefix iteration with silent steps1996-11-25Paper
Timing and causality in process algebra1996-10-27Paper
On “Axiomatising Finite Concurrent Processes”1995-03-20Paper
Adding action refinement to a finite process algebra1995-02-16Paper
A static view of localities1995-02-13Paper
GSOS and finite labelled transition systems1994-08-29Paper
Termination, deadlock, and divergence1994-08-21Paper
Turning SOS rules into equations1994-06-19Paper
Towards action-refinement in process algebras1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40365891993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40235881993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q40154851993-01-13Paper
https://portal.mardi4nfdi.de/entity/Q40154881993-01-13Paper
https://portal.mardi4nfdi.de/entity/Q32040331989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30302381987-01-01Paper

Research outcomes over time

This page was built for person: Luca Aceto