Zobrazeno 1 - 10
of 44
pro vyhledávání: '"MATIAS, David"'
Publikováno v:
Science of Computer Programming, Volume 172, pages 1-26, 2019, Elsevier
Stream GSOS is a specification format for operations and calculi on infinite sequences. The notion of bisimilarity provides a canonical proof technique for equivalence of closed terms in such specifications. In this paper, we focus on open terms, whi
Externí odkaz:
http://arxiv.org/abs/1811.03606
Autor:
Lee, Matias David, Luttik, Bas
Publikováno v:
EPTCS 222, 2016, pp. 45-59
A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus, i.e. processe
Externí odkaz:
http://arxiv.org/abs/1608.03128
Publikováno v:
EPTCS 190, 2015, pp. 31-45
Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta / nt\mu x\theta$ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bi
Externí odkaz:
http://arxiv.org/abs/1508.06710
Publikováno v:
In Science of Computer Programming 1 March 2019 172:1-26
Tree rules in probabilistic transition system specifications with negative and quantitative premises
Publikováno v:
EPTCS 89, 2012, pp. 115-130
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that isimilarity is a co
Externí odkaz:
http://arxiv.org/abs/1208.2752
Publikováno v:
In Information and Computation August 2016 249:76-109
Autor:
Matias David Lee, Bas Luttik
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 222, Iss Proc. EXPRESS/SOS 2016, Pp 45-59 (2016)
A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus, i.e. processe
Externí odkaz:
https://doaj.org/article/bf455809fb3a421185d4c65664b62986
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 190, Iss Proc. EXPRESS/SOS 2015, Pp 31-45 (2015)
Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a c
Externí odkaz:
https://doaj.org/article/9213a5bb80c141bcb4c4f7af4336be44
Autor:
Matias, David
Cada vez mais, em ambientes organizacionais, os sistemas de informação são os instrumentos mais importantes para a sua sobrevivência no mercado, tanto em termos de crescimento como de gestão interna, desde os seus clientes até aos seus próprio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1714::d17c1615e64445e1f28bf31b7d7d0947
https://hdl.handle.net/10400.26/42966
https://hdl.handle.net/10400.26/42966
Tree rules in probabilistic transition system specifications with negative and quantitative premises
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 89, Iss Proc. EXPRESS/SOS 2012, Pp 115-130 (2012)
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that isimilarity is a co
Externí odkaz:
https://doaj.org/article/b4ec487e76394b41971b6618b4aaced7