Matias David Lee

Affiliations:
  • ENS Lyon, Université de Lyon, LIP


According to our database1, Matias David Lee authored at least 17 papers between 2010 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Bisimilarity of open terms in stream GSOS.
Sci. Comput. Program., 2019

2018
A Petri Net Based Modeling of Active Objects and Futures.
Fundam. Informaticae, 2018

2017
Bisimilarity of Open Terms in Stream GSOS.
Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

The Road from Stochastic Automata to the Simulation of Rare Events.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

2016
A general SOS theory for the specification of probabilistic transition systems.
Inf. Comput., 2016

Unique Parallel Decomposition for the Pi-calculus.
Proceedings of the Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, 2016

Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Input/Output Stochastic Automata - Compositionality and Determinism.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

2015
Rooted branching bisimulation as a congruence for probabilistic transition systems.
Proceedings of the Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, 2015

SOS rule formats for convex and abstract probabilistic bisimulations.
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

2014
Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2012
Tree rules in probabilistic transition system specifications with negative and quantitative premises
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Petri Net Based Analysis of Deadlocks for Active Objects and Futures.
Proceedings of the Formal Aspects of Component Software, 9th International Symposium, 2012

2011
Semantics for Interactive Sequential Systems and Non-Interference Properties.
CLEI Electron. J., 2011

2010
Describing Secure Interfaces with Interface Automata.
Proceedings of the 7th International Workshop on Formal Engineering approaches to Software Components and Architectures, 2010

A Refinement Based Notion of Non-interference for Interface Automata: Compositionality, Decidability and Synthesis.
Proceedings of the SCCC 2010, 2010


  Loading...