Nicoletta Sabadini

Simone Tini

Theor. Comput. Sci., 2021

A Canonical Algebra of Open Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

2020

CospanSpan(Graph): a Compositional Description of the Heart System.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Compositional Modeling of Biological Systems in CospanSpan(Graph).

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2017

On the geometry and algebra of networks with state.

[BibT_eX]

[DOI]

Filippo Schiavio

Theor. Comput. Sci., 2017

Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks.

[BibT_eX]

[DOI]

Alessandro Gianola

Stefano Kasangian

Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2015

Blocked-Braid Groups.

[BibT_eX]

[DOI]

D. Maglia

Appl. Categorical Struct., 2015

2014

Obituary Alberto Bertoni (1946-2014).

[BibT_eX]

[DOI]

Bull. EATCS, 2014

2011

The compositional construction of Markov processes II.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Tangled Circuits

[BibT_eX]

[DOI]

CoRR, 2011

The Compositional Construction of Markov Processes.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2011

2009

An Algebra of Automata That Includes Both Classical and Quantum Entities.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Quantum Physics and Logic, 2009

An algebra of automata which includes both classical and quantum entities

[BibT_eX]

[DOI]

CoRR, 2009

2008

Calculating Colimits Compositionally.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

2004

Minimisation and minimal realisation in Span(Graph).

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2004

2003

Hierarchical Automata and P-systems.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Compositional Minimization in Span(Graph): Some Examples.

[BibT_eX]

[DOI]

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Timing in the Cospan-Span Model.

[BibT_eX]

[DOI]

Alessandra Cherubini

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

2002

Feedback, trace and fixed-point semantics.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

2001

Comparing cospan-spans and tiles via a Hoare-style process calculus.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

P Systems with Gemmation of Mobile Membranes.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

On Automata with Boundary

[BibT_eX]

[DOI]

CoRR, 2000

A Formalization of the IWIM Model.

[BibT_eX]

[DOI]

Proceedings of the Coordination Languages and Models, 4th International Conference, 2000

1998

Minimal Realization in Bicategories of Automata.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

1997

Representing Place/Transition Nets in Span(Graph).

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1997

Span(Graph): A Categorial Algebra of Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1997

1996

Probabilistic Asynchronous Automata.

[BibT_eX]

[DOI]

S. Jesi

Giovanni Pighizzini

Math. Syst. Theory, 1996

A Note on Recursive Functions.

[BibT_eX]

[DOI]

Sebastiano Vigna

Math. Struct. Comput. Sci., 1996

Matrices, machines and behaviors.

[BibT_eX]

[DOI]

Stephen L. Bloom

Appl. Categorical Struct., 1996

1995

Counting Techniques for Inclusion, Equivalence and Membership Problems.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages

[BibT_eX]

[DOI]

Danilo Bruschi

Giovanni Pighizzini

Inf. Comput., February, 1994

1993

A Notion of Refinement for Automata.

[BibT_eX]

Sebastiano Vigna

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992

Holonomic Generating Functions and Context Free Languages.

[BibT_eX]

[DOI]

Paolo Massazza

Int. J. Found. Comput. Sci., 1992

Recognizing sets of labelled acyclic graphs.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

1991

The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1989

Membership Problems for Regular and Context-Free Trace Languages

[BibT_eX]

[DOI]

Inf. Comput., August, 1989

1988

Generating functions of trace languages.

[BibT_eX]

Bull. EATCS, 1988

On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.

[BibT_eX]

[DOI]

Danilo Bruschi

Giovanni Pighizzini

Proceedings of the STACS 88, 1988

1987

Computing the Counting Function of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

1986

Parallel Algorithms and the Classification of Problems.

[BibT_eX]

[DOI]

Proceedings of the WOPPLOT 86, 1986

Analysis of a Class of Algorithms for Problems on Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1986

1982

Equivalence and Membership Problems for Regular Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

A # P-Complete Problem over Arithmetical Trees.

[BibT_eX]

[DOI]