default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert F. C. Walters
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j15]Nicoletta Sabadini, Filippo Schiavio
, Robert F. C. Walters:
On the geometry and algebra of networks with state. Theor. Comput. Sci. 664: 144-163 (2017)- 2015
- [j14]D. Maglia, Nicoletta Sabadini, Robert F. C. Walters:
Blocked-Braid Groups. Appl. Categorical Struct. 23(1): 53-61 (2015) - 2011
- [j13]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The Compositional Construction of Markov Processes. Appl. Categorical Struct. 19(1): 425-437 (2011) - [j12]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes II. RAIRO Theor. Informatics Appl. 45(1): 117-142 (2011) - 2004
- [j11]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Minimisation and minimal realisation in Span(Graph). Math. Struct. Comput. Sci. 14(5): 685-714 (2004) - 2003
- [j10]Michael R. Bush, M. Leeming, Robert F. C. Walters:
Computing left Kan extensions. J. Symb. Comput. 35(2): 107-126 (2003) - 2002
- [j9]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Feedback, trace and fixed-point semantics. RAIRO Theor. Informatics Appl. 36(2): 181-194 (2002) - 1998
- [j8]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Minimal Realization in Bicategories of Automata. Math. Struct. Comput. Sci. 8(2): 93-116 (1998) - 1996
- [j7]Stephen L. Bloom, Nicoletta Sabadini, Robert F. C. Walters:
Matrices, machines and behaviors. Appl. Categorical Struct. 4(4): 343-360 (1996) - [j6]Nicoletta Sabadini, Sebastiano Vigna, Robert F. C. Walters:
A Note on Recursive Functions. Math. Struct. Comput. Sci. 6(2): 127-139 (1996) - 1995
- [j5]Eric G. Wagner, Wafaa Khalil, Robert F. C. Walters:
Fix-point Semantics for Programs in Distributive Categories. Fundam. Informaticae 22(1/2): 187-202 (1995) - [j4]S. Carmody, M. Leeming, Robert F. C. Walters:
The Todd-Coxeter Procedure and Left Kan Extensions. J. Symb. Comput. 19(5): 459-488 (1995) - 1993
- [j3]G. M. Kelly, Stephen Lack, Robert F. C. Walters:
Coinverters and categories of fractions for categories with structure. Appl. Categorical Struct. 1(1): 95-102 (1993) - [j2]Wafaa Khalil, Robert F. C. Walters:
An Imperative Language Based on Distributive Categories II. RAIRO Theor. Informatics Appl. 27(6): 503-522 (1993) - 1992
- [j1]Robert F. C. Walters:
An Imperative Language Based on Distributive Categories. Math. Struct. Comput. Sci. 2(3): 249-256 (1992)
Conference and Workshop Papers
- 2009
- [c11]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes. ICTCS 2009: 91-98 - [c10]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
An Algebra of Automata That Includes Both Classical and Quantum Entities. QPL@MFPS 2009: 263-272 - 2008
- [c9]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Calculating Colimits Compositionally. Concurrency, Graphs and Models 2008: 581-592 - 2003
- [c8]Nicoletta Sabadini, Robert F. C. Walters:
Hierarchical Automata and P-systems. CATS 2003: 5-19 - [c7]Alessandra Cherubini, Nicoletta Sabadini, Robert F. C. Walters:
Timing in the Cospan-Span Model. COMETA 2003: 81-97 - [c6]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Compositional Minimization in Span(Graph): Some Examples. COMETA 2003: 181-197 - 2001
- [c5]Fabio Gadducci, Piergiulio Katis, Ugo Montanari, Nicoletta Sabadini, Robert F. C. Walters:
Comparing cospan-spans and tiles via a Hoare-style process calculus. TOSCA 2001: 157-176 - 2000
- [c4]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
A Formalization of the IWIM Model. COORDINATION 2000: 267-283 - 1997
- [c3]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Span(Graph): A Categorial Algebra of Transition Systems. AMAST 1997: 307-321 - [c2]Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
Representing Place/Transition Nets in Span(Graph). AMAST 1997: 322-336 - 1993
- [c1]Nicoletta Sabadini, Sebastiano Vigna, Robert F. C. Walters:
A Notion of Refinement for Automata. AMAST 1993: 325-332
Informal and Other Publications
- 2011
- [i4]Robert D. Rosebrugh, Nicoletta Sabadini, Robert F. C. Walters:
Tangled Circuits. CoRR abs/1110.0715 (2011) - 2009
- [i3]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes. CoRR abs/0901.2434 (2009) - [i2]Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
An algebra of automata which includes both classical and quantum entities. CoRR abs/0901.4754 (2009) - 2000
- [i1]R. Gates, Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
On Automata with Boundary. CoRR cs.DC/0002008 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
