Roberto Gorrieri

Orcid: 0000-0001-5502-0584

Affiliations:
  • University of Bologna, Italy


According to our database1, Roberto Gorrieri authored at least 159 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Axiomatizing NFAs Generated by Regular Grammars.
CoRR, 2024

2023
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets.
Log. Methods Comput. Sci., 2023

Compositional Semantics of Finite Petri Nets.
CoRR, 2023

Branching Place Bisimilarity.
CoRR, 2023

Distributed Non-Interference.
CoRR, 2023

The Algebra of Nondeterministic Finite Automata.
CoRR, 2023

2022
A study on team bisimulation and H-team bisimulation for BPP nets.
Theor. Comput. Sci., 2022

2021
Causal Semantics for BPP Nets with Silent Moves.
Fundam. Informaticae, 2021

Place Bisimilarity is Decidable, Indeed!
CoRR, 2021

Team bisimilarity, and its associated modal logic, for BPP nets.
Acta Informatica, 2021

A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (11).
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

2020
Team equivalences for finite-state machines with silent moves.
Inf. Comput., 2020

A Study on Team Bisimulations for BPP Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

Interleaving vs True Concurrency: Some Instructive Security Examples.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019
Axiomatizing Team Equivalence for Finite-State Machines.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

Toward Distributed Computability Theory.
Proceedings of the Carl Adam Petri: Ideas, Personality, Impact, 2019

2018
Verification of finite-state machines: A distributed approach.
J. Log. Algebraic Methods Program., 2018

2017
Process Algebras for Petri Nets - The Alphabetization of Distributed Systems
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-55559-1, 2017

CCS(25, 12) is Turing-complete.
Fundam. Informaticae, 2017

2016
Language representability of finite place/transition Petri nets.
Vietnam. J. Comput. Sci., 2016

2015
Introduction to Concurrency Theory - Transition Systems and CCS
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-21491-7, 2015

Language Representability of Finite P/T Nets.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

2011
An Operational Petri Net Semantics for A<sup>2</sup>CCS.
Fundam. Informaticae, 2011

On Intransitive Non-interference in Some Models of Concurrency.
Proceedings of the Foundations of Security Analysis and Design VI, 2011

2010
On the Decidability of Non Interference over Unbounded Petri Nets
Proceedings of the Proceedings 8th International Workshop on Security Issues in Concurrency, 2010

A Process Calculus for Expressing Finite Place/Transition Petri Nets
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

2009
An expressiveness study of priority in process calculi.
Math. Struct. Comput. Sci., 2009

Structural non-interference in elementary and trace nets.
Math. Struct. Comput. Sci., 2009

Distributed semantics for the pi-calculus based on Petri nets with inhibitor arcs.
J. Log. Algebraic Methods Program., 2009

On Petri Net semantics for Process Calculi.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

On the Relationship between π-Calculus and Finite Place/Transition Petri Nets.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks.
J. Autom. Reason., 2008

Towards Information Flow Properties for Distributed Systems.
Proceedings of the 3rd International Workshop on Views On Designing Complex Architectures, 2008

pi@: A pi-Based Process Calculus for the Implementation of Compartmentalised Bio-inspired Calculi.
Proceedings of the Formal Methods for Computational Systems Biology, 2008

Petri Net Security Checker: Structural Non-interference at Work.
Proceedings of the Formal Aspects in Security and Trust, 5th International Workshop, 2008

Ugo Montanari and Concurrency Theory.
Proceedings of the Concurrency, 2008

2007
Obituary, Nadia Busi (1968-2007).
Bull. EATCS, 2007

On the Expressive Power of Global and Local Priority in Process Calculi.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
On the Computational Power of Brane Calculi.
Trans. Comp. Sys. Biology, 2006

Supporting Secure Coordination in SecSpaces.
Fundam. Informaticae, 2006

: A Calculus for Service Oriented Computing.
Proceedings of the Service-Oriented Computing, 2006

Choreography and Orchestration Conformance for System Design.
Proceedings of the Coordination Models and Languages, 8th International Conference, 2006

2005
Theoretical foundations of security analysis and design II.
Theor. Comput. Sci., 2005

Quantitative information in the tuple space coordination model.
Theor. Comput. Sci., 2005

A Formalization of Credit and Responsibility Within the GNDC Schema.
Proceedings of the First International Workshop on Security and Trust Management, 2005

Towards a formal framework for Choreography.
Proceedings of the 14th IEEE International Workshops on Enabling Technologies (WETICE 2005), 2005

Choreography and Orchestration: A Synergic Approach for System Design.
Proceedings of the Service-Oriented Computing, 2005

Reasoning About Interaction Patterns in Choreography.
Proceedings of the Formal Techniques for Computer Systems and Business Processes, 2005

2004
A simple framework for real-time cryptographic protocol analysis with compositional proof rules.
Sci. Comput. Program., 2004

A process-algebraic approach for the analysis of probabilistic noninterference.
J. Comput. Secur., 2004

Automated analysis of timed security: a case study on web privacy.
Int. J. Inf. Sec., 2004

Preface.
Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models, 2004

On the Expressiveness of Probabilistic and Prioritized Data-retrieval in Linda.
Proceedings of the 2nd International Workshop on Security Issues in Coordination Models, 2004

Contrasting Malicious Java Applets by Modifying the Java Virtual Machine.
Proceedings of the Security and Protection in Information Processing Systems, 2004

Web Services for E-commerce: guaranteeing security access and quality of service.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Security Issues in the Tuple-Space Coordination Model.
Proceedings of the Formal Aspects in Security and Trust: Second IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), 2004

Towards a Formal Treatment of Secrecy Against Computational Adversaries.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model.
Proceedings of the Coordination Models and Languages, 6th International Conference, 2004

Positive Non-interference in Elementary and Trace Nets.
Proceedings of the Applications and Theory of Petri Nets 2004, 2004

2003
A comparison of three authentication properties.
Theor. Comput. Sci., 2003

Real-time information flow analysis.
IEEE J. Sel. Areas Commun., 2003

Approximating Imperfect Cryptography in a Formal Model.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Combining Partitions in SecSpaces.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

A formal approach for checking security properties in SecSpaces.
Proceedings of the First International Workshop on Security Issues in Coordination Models, 2003

Preface: Proceedings of the MEFISTO Project 2003, Formal Methods for Security and Time.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

On Securing Real-Time Speech Transmission over the Internet: An Experimental Study.
EURASIP J. Adv. Signal Process., 2003

Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Study about Trade-Off between Performance and Security in an Internet Audio Mechanism.
Proceedings of the Global Computing. Programming Environments, 2003

Formal Anaylsis of Some Timed Security Properties in Wireless Protocols.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2003

A Simple Language for Real-Time Cryptographic Protocol Analysis.
Proceedings of the Programming Languages and Systems, 2003

Compositional Verification of Integrity for Digital Stream Signature Protocols.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

A Survey on Non-interference with Petri Nets.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement.
ACM Trans. Comput. Log., 2002

Editorial.
Theor. Comput. Sci., 2002

The theory of interactive generalized semi-Markov processes.
Theor. Comput. Sci., 2002

Unified specification and performance evaluation using stochastic process algebras.
Perform. Evaluation, 2002

SecSpaces: a Data-driven Coordination Model for Environments Open to Untrusted Agents.
Proceedings of the Foundations of Coordination Languages and Software Architectures, 2002

Security Analysis of a Probabilistic Non-repudiation Protocol.
Proceedings of the Process Algebra and Probabilistic Methods, 2002

Classification of Security Properties - Part II: Network Security.
Proceedings of the Foundations of Security Analysis and Design II, 2002

Two Formal Approaches for Approximating Noninterference Properties.
Proceedings of the Foundations of Security Analysis and Design II, 2002

2001
Comparing the QoS of Internet audio mechanisms via formal methods.
ACM Trans. Model. Comput. Simul., 2001

Corrigendum to "A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time" - [TCS 202 (1998) 1-54].
Theor. Comput. Sci., 2001

Vertical Implementation.
Inf. Comput., 2001

Formal Models of Timing Attacks on Web Privacy.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Techniques for Security Checking: Non-Interference vs Control Flow Analysis.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

CVS at Work: A Report on New Failures upon Some Cryptographic Protocols.
Proceedings of the Information Assurance in Computer Networks: Methods, 2001

Temporary Data in Shared Dataspace Coordination Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Coordination Models: A Guided Tour.
Proceedings of the Coordination of Internet Agents: Models, Technologies, and Applications, 2001

Action Refinement.
Proceedings of the Handbook of Process Algebra, 2001

2000
A compiler for analyzing cryptographic protocols using noninterference.
ACM Trans. Softw. Eng. Methodol., 2000

Comparing three semantics for Linda-like languages.
Theor. Comput. Sci., 2000

On the Expressiveness of Linda Coordination Primitives.
Inf. Comput., 2000

Coping with denial of service due to malicious Java applets.
Comput. Commun., 2000

Introduction: International Workshop on Process Algebra and Performance Modelling.
Proceedings of the ICALP Workshops 2000, 2000

Non Interference for the Analysis of Cryptographic Protocols.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Classification of Security Properties (Part I: Information Flow).
Proceedings of the Foundations of Security Analysis and Design, 2000

On the Semantics of JavaSpaces.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems IV, 2000

Information Flow Analysis in a Discrete-Time Process Algebra.
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000

Message Authentication through Non Interference.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

Process Calculi for Coordination: From Linda to JavaSpaces.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999
Secrecy in Security Protocols as Non Interference.
Proceedings of the Workshop on Secure Architectures and Information Flow 1999, 1999

Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement.
Proceedings of the 6th International Workshop on Expressiveness in Concurrency, 1999

Computing Surveys' Electronic Symposium on the Theory of Computation.
ACM Comput. Surv., 1999

CVS: A Compiler for the Analysis of Cryptographic Protocols.
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999

1998
Foreword: Theoretical Aspects of Coordination Languages.
Theor. Comput. Sci., 1998

A Process Algebraic View of Linda Coordination Primitives.
Theor. Comput. Sci., 1998

A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time.
Theor. Comput. Sci., 1998

Towards parallelization of concurrent systems.
RAIRO Theor. Informatics Appl., 1998

A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems.
Inf. Comput., 1998

Formal Performance Modelling and Evaluation of an Adaptive Mechanism for Packetised Audio over the Internet.
Formal Aspects Comput., 1998

Panel Introduction: Varieties of Authentication.
Proceedings of the 11th IEEE Computer Security Foundations Workshop, 1998

Towards Performance Evaluation with General Distributions in Process Algebras.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties.
IEEE Trans. Software Eng., 1997

On the Turing equivalence of Linda coordination primitives.
Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

Performance Preorder and Competitive Equivalence.
Acta Informatica, 1997

Action Refinement as an Implementation Relations.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Action refinement for Vertical Implementation.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1997

Three Semantics of the Output Operation for Generative Communication.
Proceedings of the Coordination Languages and Models, Second International Conference, 1997

1996
Comparing Syntactic and Semantic Sction Refinement.
Inf. Comput., 1996

On the Power of Concurrency Theory.
ACM Comput. Surv., 1996

Automatic Compositional Verification of Some Security Properties.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Extended Markovian Process Algebra.
Proceedings of the CONCUR '96, 1996

A Study on the Specification and Verification of Performance Properties (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology, 1996

1995
A Causal Operational Semantics of Action Refinement
Inf. Comput., October, 1995

Split and ST Bisimulation Semantics
Inf. Comput., May, 1995

A Theory of Processes with Durational Actions.
Theor. Comput. Sci., 1995

On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies.
Theor. Comput. Sci., 1995

A Taxonomy of Security Properties for Process Algebras.
J. Comput. Secur., 1995

A Distributed Semantics for EMPA Based on Stochastic Contextual Nets.
Comput. J., 1995

Giving a net semantics to Markovian process algebra.
Proceedings of the Sixth International Workshop on Petri Nets and Performance Models, 1995

Performance Preorder: Ordering Processes with Respect to Speed.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

The security checker: a semantics-based tool for the verification of security properties.
Proceedings of the Eighth IEEE Computer Security Foundations Workshop (CSFW '95), 1995

A Petri Net Semantics for pi-Calculus.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
On Syntactic and Semantic Action Refinement.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Axiomatising ST-Bisimulation Equivalence.
Proceedings of the Programming Concepts, 1994

Integrated analysis of concurrent distributed systems using Markovian process algebra.
Proceedings of the Formal Description Techniques VII, 1994

Distributed Conflicts in Communicating Systems.
Proceedings of the Object-Based Models and Languages for Concurrent Systems, 1994

A Taxonomy of Security Properties for CCS.
Proceedings of the Seventh IEEE Computer Security Foundations Workshop, 1994

Real-Time System Verification using P/T Nets.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
Distributed Logic Programming.
J. Log. Program., 1993

On Relating Some Models for Concurrency.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Towards Performance Evaluation in Process Algebras.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992
A hierarchy of system descriptions via atomic linear refinement.
Fundam. Informaticae, 1992

A Categorial View of Process Refinement.
Proceedings of the Sematics: Foundations and Applications, 1992

1991
An Extended Expansion Theorem.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

The Limit of Split_n-Bisimulations for CCS Agents.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Atomic Refinement in Process Description Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Distributed Implementation of CCS.
Proceedings of the Advances in Petri Nets 1993, 1991

1990
A2CCKS: Atomic Actions for CCS.
Theor. Comput. Sci., 1990

Towards Hierarchical Description of Systems: A Proof System for Strong Prefixing.
Int. J. Found. Comput. Sci., 1990

Implicative Formulae in the "Proofs as Computations" Analogy.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

SCONE: A Simple Calculus of Nets.
Proceedings of the CONCUR '90, 1990

1989
A Distributed, Net Oriented Semantics for Delta Prolog.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Model Theoretic, Fixpoint and Operational Semantics for a Distributed Logic Language.
Proceedings of the Logic Programming, 1989

1988
A²CCS: A Simple Extension of CCS for Handling Atomic Actions.
Proceedings of the CAAP '88, 1988

1987
An Exercise in Concurrency: a CSP Process as a Condition/ event System.
Proceedings of the Advances in Petri Nets 1988, 1987


  Loading...