default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatias David Lee
Person information
- affiliation: ENS Lyon, Université de Lyon, LIP
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j4]Filippo Bonchi
, Tom van Bussel, Matias David Lee, Jurriaan Rot:
Bisimilarity of open terms in stream GSOS. Sci. Comput. Program. 172: 1-26 (2019)- 2018
- [j3]Frank S. de Boer, Mario Bravetti, Matias David Lee, Gianluigi Zavattaro:
A Petri Net Based Modeling of Active Objects and Futures. Fundam. Informaticae 159(3): 197-256 (2018) - [i1]Filippo Bonchi, Tom van Bussel, Matias David Lee, Jurriaan Rot:
Bisimilarity of Open Terms in Stream GSOS. CoRR abs/1811.03606 (2018) - 2017
- [c13]Pedro R. D'Argenio, Carlos E. Budde, Matias David Lee, Raúl E. Monti, Leonardo Rodríguez, Nicolás Wolovick:
The Road from Stochastic Automata to the Simulation of Rare Events. ModelEd, TestEd, TrustEd 2017: 276-294 - [c12]Filippo Bonchi, Matias David Lee, Jurriaan Rot:
Bisimilarity of Open Terms in Stream GSOS. FSEN 2017: 35-50 - 2016
- [j2]Pedro R. D'Argenio, Daniel Gebler, Matias David Lee:
A general SOS theory for the specification of probabilistic transition systems. Inf. Comput. 249: 76-109 (2016) - [c11]Pedro R. D'Argenio, Matias David Lee, Raúl E. Monti:
Input/Output Stochastic Automata - Compositionality and Determinism. FORMATS 2016: 53-68 - [c10]Matias David Lee, Erik P. de Vink:
Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions. MFCS 2016: 29:1-29:14 - [c9]Matias David Lee, Bas Luttik:
Unique Parallel Decomposition for the Pi-calculus. EXPRESS/SOS 2016: 45-59 - 2015
- [c8]Pedro R. D'Argenio, Matias David Lee, Daniel Gebler:
SOS rule formats for convex and abstract probabilistic bisimulations. EXPRESS/SOS 2015: 31-45 - [c7]Matias David Lee, Erik P. de Vink:
Rooted branching bisimulation as a congruence for probabilistic transition systems. QAPL 2015: 79-94 - 2014
- [c6]Pedro R. D'Argenio, Daniel Gebler, Matias David Lee:
Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules. FoSSaCS 2014: 289-303 - 2012
- [c5]Frank S. de Boer, Mario Bravetti, Immo Grabe, Matias David Lee, Martin Steffen, Gianluigi Zavattaro:
A Petri Net Based Analysis of Deadlocks for Active Objects and Futures. FACS 2012: 110-127 - [c4]Pedro R. D'Argenio, Matias David Lee:
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation. FoSSaCS 2012: 452-466 - [c3]Matias David Lee, Daniel Gebler, Pedro R. D'Argenio:
Tree rules in probabilistic transition system specifications with negative and quantitative premises. EXPRESS/SOS 2012: 115-130 - 2011
- [j1]Matias David Lee, Pedro R. D'Argenio:
Semantics for Interactive Sequential Systems and Non-Interference Properties. CLEI Electron. J. 14(3) (2011) - 2010
- [c2]Matias David Lee, Pedro R. D'Argenio:
A Refinement Based Notion of Non-interference for Interface Automata: Compositionality, Decidability and Synthesis. SCCC 2010: 280-289 - [c1]Matias David Lee, Pedro R. D'Argenio:
Describing Secure Interfaces with Interface Automata. FESCA@ETAPS 2010: 107-123
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 23:10 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:
