Luca Aceto

CoRR, 2023

2022

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2022

On the Axiomatisability of Parallel Composition.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Axiomatizing recursion-free, regular monitors.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2022

Interviews with the 2022 CONCUR Test-of-Time Award Recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

CONCUR through time.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Bull. EATCS, 2022

Complexity through Translations for Modal Logic with Recursion.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Games, 2022

Monitoring Hyperproperties with Circuits.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2022

A Monitoring Tool for Linear-Time μHML.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 2022

On the Axiomatisation of Branching Bisimulation Congruence over CCS.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction.

[BibT_eX]

[DOI]

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

On Probabilistic Monitorability.

[BibT_eX]

[DOI]

Proceedings of the Principles of Systems Design, 2022

2021

Comparing controlled system synthesis and suppression enforcement.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2021

An operational guide to monitorability with applications to regular properties.

[BibT_eX]

[DOI]

Softw. Syst. Model., 2021

Interviews with the 2021 CONCUR Test-of-Time Award Recipients.

[BibT_eX]

[DOI]

Nathalie Bertrand

Nobuko Yoshida

Bull. EATCS, 2021

A Choreographed Outline Instrumentation Algorithm for Asynchronous Components.

[BibT_eX]

[DOI]

CoRR, 2021

Introducing Formal Methods to First-Year Students in Three Intensive Weeks.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods Teaching - 4th International Workshop and Tutorial, 2021

In search of lost time: Axiomatising parallel composition in process algebras.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Better Late Than Never or: Verifying Asynchronous Components at Runtime.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

On Bidirectional Runtime Enforcement.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

On Benchmarking for Concurrent Runtime Verification.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Approaches to Software Engineering, 2021

Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?

[BibT_eX]

[DOI]

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

The Best a Monitor Can Do.

[BibT_eX]

[DOI]

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

On the axiomatisability of priority III: Priority strikes again.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Determinizing monitors for HML with recursion.

[BibT_eX]

[DOI]

Sævar Örn Kjartansson

J. Log. Algebraic Methods Program., 2020

The complexity of identifying characteristic formulae.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2020

Interviews with the 2020 CONCUR Test-of-Time Award Recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

An axiomatization of verdict equivalence over regular monitors.

[BibT_eX]

[DOI]

CoRR, 2020

On the Axiomatisability of Parallel Composition: A Journey in the Spectrum.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper).

[BibT_eX]

[DOI]

Jos C. M. Baeten

Patricia Bouyer-Decitre

Holger Hermanns

Alexandra Silva

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

When are prime formulae characteristic?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Adventures in monitorability: from branching to linear time and back again.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2019

Rule Formats for Nominal Process Calculi.

[BibT_eX]

[DOI]

Yolanda Ortega-Mallén

Log. Methods Comput. Sci., 2019

Logical characterisations, rule formats and compositionality for input-output conformance simulation.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2019

Interview with Murdoch J. Gabbay and Andrew M. Pitts, 2019 Alonzo Church Award Recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

An Operational Guide to Monitorability.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

On the Axiomatizability of Priority III: The Return of Sequential Composition.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way.

[BibT_eX]

[DOI]

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

The Cost of Monitoring Alone.

[BibT_eX]

[DOI]

Proceedings of the From Reactive Systems to Cyber-Physical Systems, 2019

Testing Equivalence vs. Runtime Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018

Report on ICE-TCS Theory Day 2018.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Developing Theoretical Foundations for Runtime Enforcement.

[BibT_eX]

[DOI]

CoRR, 2018

A Framework for Parameterized Monitorability.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2018

On Runtime Enforcement via Suppressions.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Spotlight on Marta Kwiatkowska.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2017

Preface for the 27th Nordic Workshop on Programming Theory (NWPT 2015).

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2017

A unified rule format for bounded nondeterminism in SOS with terms as labels.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2017

Monitorability for the Hennessy-Milner logic with recursion.

[BibT_eX]

[DOI]

Adrian Francalanza

Formal Methods Syst. Des., 2017

Computer Science at the Gran Sasso Science Institute.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Ten years of the European Research Council A view from theoretical computer science.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Interview with Alexandra Silva Recipient of the 2017 Presburger Award.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Interview with Thomas Henzinger President of IST Austria.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

A Survey of Runtime Monitoring Instrumentation Techniques.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second International Workshop on Pre- and Post-Deployment Verification Techniques, 2017

Trace Simulation Semantics is not Finitely Based over BCCSP.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015).

[BibT_eX]

[DOI]

Acta Informatica, 2017

On the Complexity of Determinizing Monitors.

[BibT_eX]

[DOI]

Sævar Örn Kjartansson

Proceedings of the Implementation and Application of Automata, 2017

Logical Characterisations and Compositionality of Input-Output Conformance Simulation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

A Foundation for Runtime Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Runtime Verification - 17th International Conference, 2017

A Generic Instrumentation Tool for Erlang.

[BibT_eX]

[DOI]

Proceedings of the RV-CuBES 2017. An International Workshop on Competitions, 2017

A Suite of Monitoring Tools for Erlang.

[BibT_eX]

[DOI]

Proceedings of the RV-CuBES 2017. An International Workshop on Competitions, 2017

Monitoring for Silent Actions.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

eAOP: an aspect oriented programming framework for Erlang.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM SIGPLAN International Workshop on Erlang, 2017

2016

Zoltan Esik (1951-2016) In Memoriam.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Report on NWPT 2015.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Viewpoints on "Logic activities in Europe", twenty years later.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.

[BibT_eX]

[DOI]

Mariangiola Dezani-Ciancaglini

Bull. EATCS, 2016

Abstracts of the EATCS Distinguished Dissertations 2015.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Report on ICALP 2016.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Report on The EATCS General Assembly.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Report on The EATCS Council Meeting.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Interview with Paul Spirakis, President of the EATCS.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Interview with Rajeev Alur and David Dill 2016 Alonzo Church Award Recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Interview with Stephen Brookes and Peter W. O'Hearn Recipients of the 2016 Godel Prize.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Model-based Testing of Mobile Systems - An Empirical Study on QuizUp Android App.

[BibT_eX]

[DOI]

Proceedings of the Proceedings First Workshop on Pre- and Post-Deployment Verification Techniques, 2016

A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases.

[BibT_eX]

[DOI]

Acta Informatica, 2016

Rule Formats for Bounded Nondeterminism in Structural Operational Semantics.

[BibT_eX]

[DOI]

Álvaro García-Pérez

Proceedings of the Semantics, Logics, and Calculi, 2016

2015

A ground-complete axiomatization of stateless bisimilarity over Linda.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Report on ICTCS 2015.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Report on ICE-TCS tenth anniversary.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Report on ICALP 2015.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Letter from the President.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

On Verifying Hennessy-Milner Logic with Recursion at Runtime.

[BibT_eX]

[DOI]

Adrian Francalanza

Proceedings of the Runtime Verification - 6th International Conference, 2015

Decision Support for Mobile Cloud Computing Applications via Model Checking.

[BibT_eX]

[DOI]

Andrea Morichetta

Francesco Tiezzi

Proceedings of the 3rd IEEE International Conference on Mobile Cloud Computing, 2015

A Cost/Reward Method for Optimal Infinite Scheduling in Mobile Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Component Software - 12th International Conference, 2015

2014

Axiomatizing weak simulation semantics over BCCSP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Modelling and simulation of asynchronous real-time systems using Timed Rebeca.

[BibT_eX]

[DOI]

Arni Hermann Reynisson

Steinar Hugi Sigurdarson

Sci. Comput. Program., 2014

SOS rule formats for idempotent terms and idempotent unary operators.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2014

Report on Two events at ICE-TCS, Reykjavik University.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Bull. EATCS, 2014

Report on ICALP 2014.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

Foreword to the contributions by two EATCS award-recipients.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

On the Expressiveness of the Interval Logic of Allen's Relations Over Finite and Discrete Linear Orders.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

2013

On the specification of modal systems: A comparison of three frameworks.

[BibT_eX]

[DOI]

Miguel Palomino

Sci. Comput. Program., 2013

38th International Colloquium on Automata, Languages and Programming.

[BibT_eX]

[DOI]

Monika Henzinger

Jirí Sgall

Inf. Comput., 2013

Report on ICALP 2013.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

Report on the General Assembly 2013.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

Meta SOS - A Maude Based SOS Meta-Theory Framework.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, 2013

A Complete Classification of the Expressiveness of Interval Logics of Allen's Relations over Dense Linear Orders.

[BibT_eX]

[DOI]

Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Compositional Reasoning for Multi-modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

Exploiting Algebraic Laws to Improve Mechanized Axiomatizations.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012

Rule formats for distributivity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Rule formats for determinism and idempotence.

[BibT_eX]

[DOI]

Arnar Birgisson

Sci. Comput. Program., 2012

Characteristic formulae for fixed-point semantics: a general framework.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

Proving the validity of equations in GSOS languages using rule-matching bisimilarity.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

Characteristic Formulae for Relations with Nested Fixed Points

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

The Equational Theory of Weak Complete Simulation Semantics over BCCSP.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Algebraic Synchronization Trees and Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

The algorithmics of bisimilarity.

[BibT_eX]

Jirí Srba

Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011

SOS rule formats for zero and unit elements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the axiomatizability of priority II.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

The Concurrency Column.

[BibT_eX]

[DOI]

Bull. EATCS, 2011

Graphical representation of covariant-contravariant modal formulae

[BibT_eX]

[DOI]

Miguel Palomino

Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Axiomatizing GSOS with Predicates

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eight Workshop on Structural Operational Semantics 2011, 2011

Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca

[BibT_eX]

[DOI]

Arni Hermann Reynisson

Steinar Hugi Sigurdarson

Marjan Sirjani

Proceedings of the Proceedings 10th International Workshop on the Foundations of Coordination Languages and Software Architectures, 2011

Sigma algebras in probabilistic epistemic dynamics.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Axiomatizing Weak Ready Simulation Semantics over BCCSP.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations.

[BibT_eX]

[DOI]

Miguel Palomino

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Decompositional Reasoning about the History of Parallel Processes.

[BibT_eX]

[DOI]

Arnar Birgisson

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010

Resource bisimilarity and graded bisimilarity coincide.

[BibT_eX]

[DOI]

Joshua Sack

Inf. Process. Lett., 2010

On Rule Formats for Zero and Unit Elements.

[BibT_eX]

[DOI]

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

Lifting non-finite axiomatizability results to extensions of process algebras.

[BibT_eX]

[DOI]

Acta Informatica, 2010

A Rule Format for Unit Elements.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009

A finite equational base for CCS with left merge and communication merge.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Foreword: special issue in memory of Nadia Busi.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

Preface.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2009

On the relations between B<sub>2</sub>V Ms and Runge-Kutta collocation methods.

[BibT_eX]

[DOI]

Cecilia Magherini

J. Comput. Appl. Math., 2009

Algebraic Properties for Free!

[BibT_eX]

Bull. EATCS, 2009

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

Characteristic Formulae for Fixed-Point Semantics: A General Framework

[BibT_eX]

[DOI]

Joshua Sack

Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

Teaching Concurrency: Theory in Practice.

[BibT_eX]

[DOI]

Kim Guldstrand Larsen

Jirí Srba

Proceedings of the Teaching Formal Methods, Second International Conference, 2009

2008

On the axiomatisability of priority.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2008

On the expressibility of priority.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The equational theory of prebisimilarity over basic CCS with divergence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

A Cancellation Theorem for BCCSP.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt.

[BibT_eX]

Silvio Capobianco

Bull. EATCS, 2008

Applying Concurrency Research in Industry Report on a Strategic Workshop.

[BibT_eX]

Bull. EATCS, 2008

Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

Characteristic Formulae: From Automata to Logic.

[BibT_eX]

Bull. EATCS, 2007

The Saga of the Axiomatization of Parallel Composition.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Impossibility Results for the Equational Theory of Timed CCS.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

Ready to Preorder: Get Your BCCSP Axiomatization for Free!

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Bisimilarity is not finitely based over BPA with interrupt.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Impossibility Results in the Equational Logic of Processes.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Logic, Models and Computer Science, 2006

On the Axiomatizability of Priority.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

CCS with Hennessy's merge has no finite-equational axiomatization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Guest editors' foreword: Process Algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Andrew D. Gordon

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Finite Equational Bases in Process Algebra: Results and Open Questions.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2004

Guesteditors'introduction: Special issue on Structural Operational Semantics.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2004

The Complexity of Checking Consistency of Pedigree Information and Related Problems.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

Nested semantics over finite trees are equationally hard.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Preface.

[BibT_eX]

[DOI]

Irek Ulidowski

Proceedings of the Workshop on Structural Operational Semantics, 2004

2003

The max-plus algebra of the natural numbers has no finite equational basis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Equational theories of tropical semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The power of reachability testing for timed automata.

[BibT_eX]

[DOI]

Patricia Bouyer

Augusto Burgueño

Kim Guldstrand Larsen

Theor. Comput. Sci., 2003

Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation.

[BibT_eX]

[DOI]

Giuseppe Longo

Björn Victor

Math. Struct. Comput. Sci., 2003

A note on an expressiveness hierarchy for multi-exit iteration.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Nested Semantics over Finite Trees are Equationally Hard: Invited Talk.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Some of My Favourite Results in Classic Process Algebra.

[BibT_eX]

Bull. EATCS, 2003

2002

Guest Editors' Foreword.

[BibT_eX]

Prakash Panangaden

Nord. J. Comput., 2002

Is your model checker on time? On the complexity of model checking for timed modal logics.

[BibT_eX]

[DOI]

François Laroussinie

J. Log. Algebraic Methods Program., 2002

A Fully Equational Proof of Parikh's Theorem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

Kleene through the process algebraic glass.

[BibT_eX]

Proceedings of the Fixed Points in Computer Science, 2002

Equational Axioms for Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2002

2001

Preface: Process Algebra.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.

[BibT_eX]

[DOI]

Samson Abramsky

Inf. Comput., 2001

Preface.

[BibT_eX]

[DOI]

Prakash Panangaden

Proceedings of the 8th International Workshop on Expressiveness in Concurrency, 2001

2-Nested Simulation Is Not Finitely Equationally Axiomatizable.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Axiomatizing Tropical Semirings.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Conservative Extension in Structural Operational Semantics.

[BibT_eX]

Chris Verhoef

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Structural Operational Semantics.

[BibT_eX]

[DOI]

Chris Verhoef

Proceedings of the Handbook of Process Algebra, 2001

2000

Characteristic formulae for timed automata.

[BibT_eX]

[DOI]

Mikkel Lykke Pedersen

Jan Poulsen

RAIRO Theor. Informatics Appl., 2000

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

1999

A Complete Equational Axiomatization for MPA with String Iteration.

[BibT_eX]

[DOI]

Jan Friso Groote

Theor. Comput. Sci., 1999

Conservative Extension in Structural Operational Semantics.

[BibT_eX]

Chris Verhoef

Bull. EATCS, 1999

Testing Hennessy-Milner Logic with Recursion.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998

On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

Model Checking via Reachability Testing for Timed Automata.

[BibT_eX]

[DOI]

Augusto Burgueño

Kim Guldstrand Larsen

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1998

A Cook's Tour of Equational Axiomatizations for Prefix Iteration.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997

A Characterization of Finitary Bisimulation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

An Equational Axiomatization for Multi-Exit Iteration.

[BibT_eX]

[DOI]

Inf. Comput., 1997

Relating semantic models for the object calculus.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

1996

CPO Models for Compact GSOS Languages.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Axiomatizing Prefix Iteration with Silent Steps.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Timing and Causality in Process Algebra.

[BibT_eX]

[DOI]

David Murphy

Acta Informatica, 1996

An Equational Axiomatization of Observation Congruence for Prefix Iteration.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1996

1995

A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours.

[BibT_eX]

[DOI]

Alan Jeffrey

Theor. Comput. Sci., 1995

CPO Models for a Class of GSOS Languages.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1994

Adding Action Refinement to a Finite Process Algebra

[BibT_eX]

[DOI]

Matthew Hennessy

Inf. Comput., December, 1994

Turning SOS Rules into Equations

[BibT_eX]

[DOI]

Bard Bloom

Frits W. Vaandrager

Inf. Comput., May, 1994

GSOS and Finite Labelled Transition Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

On "Axiomatising Finite Concurrent Processes".

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

A Static View of Localities.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1994

Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '94, 1994

1993

Towards Action-Refinement in Process Algebras

[BibT_eX]

[DOI]

Matthew Hennessy

Inf. Comput., April, 1993

On the Ill-Timed but Well-Caused.

[BibT_eX]

[DOI]

David Murphy

Proceedings of the CONCUR '93, 1993

1992

Termination, Deadlock, and Divergence.

[BibT_eX]

[DOI]

Matthew Hennessy

J. ACM, 1992

Relating distributed, temporal and causal observations of simple processes.

[BibT_eX]

Fundam. Informaticae, 1992

History preserving, causal and mixed-ordering equivalence over stable event structures.

[BibT_eX]

Fundam. Informaticae, 1992

1991

Action refinement in process algebras.

[BibT_eX]

[DOI]

PhD thesis, 1991

Full Abstraction for Series-Parallel Pomsets.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

On Relating Concurency and Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

Failures Semantics for a Simple Process Language with Refinement.

[BibT_eX]

[DOI]

Uffe Engberg

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

A Theory of Testing for ACP.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '91, 1991

1986

Testing Equivalences for Event Structures.

[BibT_eX]

[DOI]