| Publication | Date of Publication | Type |
|---|
Complexity results for modal logic with recursion via translations and tableaux
Logical Methods in Computer Science | 2024-09-04 | Paper |
| On the axiomatisation of branching bisimulation congruence over CCS | 2024-08-13 | Paper |
| An Operational Guide to Monitorability | 2024-03-14 | Paper |
Testing equivalence vs. runtime monitoring
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
Building international doctoral schools in computer science in Italy, De Nicola's way
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
Complexity through translations for modal logic with recursion
(available as arXiv preprint) | 2024-02-08 | Paper |
| Complexity through translations for modal logic with recursion | 2024-02-08 | Paper |
On first-order runtime enforcement of branching-time properties
Acta Informatica | 2023-11-21 | Paper |
On relating concurrency and nondeterminism
Lecture Notes in Computer Science | 2023-08-16 | Paper |
On probabilistic monitorability
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Termination, deadlock and divergence
Lecture Notes in Computer Science | 2023-04-12 | Paper |
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
Logical Methods in Computer Science | 2023-03-22 | Paper |
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Monitoring hyperproperties with circuits
(available as arXiv preprint) | 2022-08-19 | Paper |
CPO models for a class of GSOS languages
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
| CONCUR Test-of-time award 2020 announcement | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559474 (Why is no real title available?) | 2022-07-18 | Paper |
Axiomatizing recursion-free, regular monitors
Journal of Logical and Algebraic Methods in Programming | 2022-05-25 | Paper |
| On bidirectional runtime enforcement | 2022-03-21 | Paper |
scientific article; zbMATH DE number 7471704 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471704 (Why is no real title available?) | 2022-02-09 | Paper |
On runtime enforcement via suppressions
(available as arXiv preprint) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7356843 (Why is no real title available?) | 2021-06-09 | Paper |
scientific article; zbMATH DE number 7356843 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-09 | Paper |
| Characteristic formulae for relations with nested fixed points | 2021-03-17 | Paper |
Characteristic formulae for relations with nested fixed points
(available as arXiv preprint) | 2021-03-17 | Paper |
| scientific article; zbMATH DE number 7318985 (Why is no real title available?) | 2021-03-10 | Paper |
scientific article; zbMATH DE number 7318985 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-10 | Paper |
| scientific article; zbMATH DE number 7319028 (Why is no real title available?) | 2021-03-10 | Paper |
scientific article; zbMATH DE number 7319028 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-10 | Paper |
| A bisimulation-based method for proving the validity of equations in GSOS languages | 2021-02-09 | Paper |
| Characteristic formulae for fixed-point semantics: a general framework | 2021-01-26 | Paper |
| Monitoring for silent actions | 2020-11-25 | Paper |
On the axiomatisability of priority. III: Priority strikes again
Theoretical Computer Science | 2020-08-25 | Paper |
Rule formats for nominal process calculi
(available as arXiv preprint) | 2020-05-27 | Paper |
The complexity of identifying characteristic formulae
Journal of Logical and Algebraic Methods in Programming | 2020-04-15 | Paper |
Determinizing monitors for HML with recursion
Journal of Logical and Algebraic Methods in Programming | 2020-01-31 | Paper |
| scientific article; zbMATH DE number 7150622 (Why is no real title available?) | 2020-01-13 | Paper |
Rule formats for nominal process calculi
(available as arXiv preprint) | 2019-11-26 | Paper |
| scientific article; zbMATH DE number 7075914 (Why is no real title available?) | 2019-07-03 | Paper |
Logical characterisations, rule formats and compositionality for input-output conformance simulation
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
When are prime formulae characteristic?
Theoretical Computer Science | 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
Journal of Logical and Algebraic Methods in Programming | 2017-09-12 | Paper |
Monitorability for the Hennessy-Milner logic with recursion
Formal Methods in System Design | 2017-09-08 | Paper |
Trace simulation semantics is not finitely based over BCCSP
Acta Cybernetica | 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
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Logical characterisations and compositionality of input-output conformance simulation
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
A characterization of finitary bisimulation
Information Processing Letters | 2016-05-26 | Paper |
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
Acta Informatica | 2016-04-07 | Paper |
Rule formats for bounded nondeterminism in structural operational semantics
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
Compositional reasoning for multi-modal logics
Logical Foundations of Computer Science | 2015-12-11 | Paper |
When are prime formulae characteristic?
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
The quest for equational axiomatizations of parallel composition: status and open problems
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders
Logics in Artificial Intelligence | 2015-01-14 | Paper |
A ground-complete axiomatization of stateless bisimilarity over Linda
Information Processing Letters | 2014-12-09 | Paper |
SOS rule formats for idempotent terms and idempotent unary operators
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Axiomatizing weak simulation semantics over BCCSP
Theoretical Computer Science | 2014-06-10 | Paper |
The algorithmics of bisimilarity
Advanced Topics in Bisimulation and Coinduction | 2014-04-25 | Paper |
SOS rule formats for idempotent terms and idempotent unary operators
The Journal of Logic and Algebraic Programming | 2014-02-25 | Paper |
An algorithm for enumerating maximal models of Horn theories with an application to modal logics
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
| Impossibility results in the equational logic of processes | 2013-12-04 | Paper |
Exploiting algebraic laws to improve mechanized axiomatizations
Algebra and Coalgebra in Computer Science | 2013-09-13 | Paper |
| Nested semantics over finite trees are equationally hard (invited talk) | 2013-09-09 | Paper |
Resource bisimilarity and graded bisimilarity coincide
Information Processing Letters | 2013-04-04 | Paper |
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
Information Processing Letters | 2013-03-28 | Paper |
Algebraic synchronization trees and processes
Automata, Languages, and Programming | 2012-11-01 | Paper |
Rule formats for determinism and idempotence
Science of Computer Programming | 2012-07-13 | Paper |
Decompositional reasoning about the history of parallel processes
Fundamentals of Software Engineering | 2012-06-29 | Paper |
Relating modal refinements, covariant-contravariant simulations and partial bisimulations
Fundamentals of Software Engineering | 2012-06-29 | Paper |
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Proving the validity of equations in GSOS languages using rule-matching bisimilarity
MSCS. Mathematical Structures in Computer Science | 2012-05-11 | Paper |
Characteristic formulae for fixed-point semantics: a general framework
MSCS. Mathematical Structures in Computer Science | 2012-05-11 | Paper |
Axiomatizing weak ready simulation semantics over BCCSP
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
PREG axiomatizer -- a ground bisimilarity checker for GSOS with predicates
Algebra and Coalgebra in Computer Science | 2011-09-02 | Paper |
On the axiomatizability of priority. II
Theoretical Computer Science | 2011-07-07 | Paper |
Equational axioms for probabilistic bisimilarity
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
On the expressibility of priority
Information Processing Letters | 2010-06-09 | Paper |
The equational theory of prebisimilarity over basic CCS with divergence
Information Processing Letters | 2010-06-09 | Paper |
The complexity of checking consistency of pedigree information and related problems.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
| scientific article; zbMATH DE number 5605144 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5605107 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5604093 (Why is no real title available?) | 2009-09-15 | Paper |
A note on an expressiveness hierarchy for multi-exit iteration
Information Processing Letters | 2009-04-28 | Paper |
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
Algebra and Coalgebra in Computer Science | 2009-03-10 | Paper |
| scientific article; zbMATH DE number 5506914 (Why is no real title available?) | 2009-02-12 | Paper |
The Saga of the Axiomatization of Parallel Composition
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
On the axiomatisability of priority
Mathematical Structures in Computer Science | 2008-04-10 | Paper |
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
Logical Methods in Computer Science | 2007-10-11 | Paper |
| Reactive Systems | 2007-10-04 | Paper |
A Finite Equational Base for CCS with Left Merge and Communication Merge
Automata, Languages and Programming | 2007-09-11 | Paper |
On the Axiomatizability of Priority
Automata, Languages and Programming | 2007-09-11 | Paper |
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science | 2007-01-09 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algebra and Coalgebra in Computer Science
Lecture Notes in Computer Science | 2006-10-20 | Paper |
CPO models for compact GSOS languages
Information and Computation | 2006-10-10 | Paper |
| scientific article; zbMATH DE number 2155190 (Why is no real title available?) | 2005-04-11 | Paper |
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science | 2005-02-22 | Paper |
Nested semantics over finite trees are equationally hard
Information and Computation | 2004-08-06 | Paper |
A Fully Equational Proof of Parikh's Theorem
RAIRO - Theoretical Informatics and Applications | 2003-11-20 | Paper |
A Fully Equational Proof of Parikh's Theorem
RAIRO - Theoretical Informatics and Applications | 2003-11-20 | Paper |
The power of reachability testing for timed automata
Theoretical Computer Science | 2003-07-30 | Paper |
Equational theories of tropical semirings
Theoretical Computer Science | 2003-05-25 | Paper |
The max-plus algebra of the natural numbers has no finite equational basis
Theoretical Computer Science | 2003-05-14 | Paper |
Is your model checker on time? On the complexity of model checking for timed modal logics
The Journal of Logic and Algebraic Programming | 2003-02-13 | Paper |
Corrigendum: ``A domain equation for bisimulation by S. Abramsky
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1701345 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1688353 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1638641 (Why is no real title available?) | 2001-08-29 | Paper |
Characteristic formulae for timed autoamta
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1500521 (Why is no real title available?) | 2001-02-16 | Paper |
| Structural operational semantics. | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1860682 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1407502 (Why is no real title available?) | 2000-04-06 | Paper |
| scientific article; zbMATH DE number 1418333 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1330129 (Why is no real title available?) | 1999-09-01 | Paper |
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
Mathematical Structures in Computer Science | 1999-03-22 | Paper |
A complete equational axiomatization for MPA with string iteration
Theoretical Computer Science | 1999-01-12 | Paper |
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1231588 (Why is no real title available?) | 1998-12-21 | Paper |
| scientific article; zbMATH DE number 1189291 (Why is no real title available?) | 1998-10-08 | Paper |
| scientific article; zbMATH DE number 1113857 (Why is no real title available?) | 1998-05-10 | Paper |
An equational axiomatization for multi-exit iteration
Information and Computation | 1998-02-16 | Paper |
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science | 1997-02-27 | Paper |
Axiomatizing prefix iteration with silent steps
Information and Computation | 1996-11-25 | Paper |
Timing and causality in process algebra
Acta Informatica | 1996-10-27 | Paper |
On “Axiomatising Finite Concurrent Processes”
SIAM Journal on Computing | 1995-03-20 | Paper |
Adding action refinement to a finite process algebra
Information and Computation | 1995-02-16 | Paper |
A static view of localities
Formal Aspects of Computing | 1995-02-13 | Paper |
GSOS and finite labelled transition systems
Theoretical Computer Science | 1994-08-29 | Paper |
Termination, deadlock, and divergence
Journal of the ACM | 1994-08-21 | Paper |
Turning SOS rules into equations
Information and Computation | 1994-06-19 | Paper |
Towards action-refinement in process algebras
Information and Computation | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176759 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 108007 (Why is no real title available?) | 1993-01-23 | Paper |
| scientific article; zbMATH DE number 86273 (Why is no real title available?) | 1993-01-13 | Paper |
| scientific article; zbMATH DE number 86276 (Why is no real title available?) | 1993-01-13 | Paper |
| scientific article; zbMATH DE number 4180788 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4018369 (Why is no real title available?) | 1987-01-01 | Paper |
