Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Wuzhou Zhang
Hao Mao
Jin-hwan Lee
Peter Malec
Clara Bacciu
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
MARCO PERESSOTTI
Author Info
Open Visualization
Name
Affiliation
Papers
MARCO PERESSOTTI
Univ Udine, Dept Math & Comp Sci, Lab Models & Applicat Distributed Syst, I-33100 Udine, Italy
23
Collaborators
Citations
PageRank
17
32
8.48
Referers
Referees
References
41
275
188
Search Limit
100
275
Publications (23 rows)
Collaborators (17 rows)
Referers (41 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Sliceable Monolith: Monolith First, Microservices Later
0
0.34
2021
Certifying Choreography Compilation
0
0.34
2021
Towards a formal model for composable container systems
0
0.34
2020
Computing Embeddings of Directed Bigraphs.
0
0.34
2020
Joint Post-proceedings of the First and Second International Conference on Microservices, Microservices 2017/2019, October 23-27, 2017, Odense, Denmark / February 19-21, 2019, Dortmund, Germany.
0
0.34
2020
Software Transactional Memory with Interactions
0
0.34
2020
Taking Linear Logic Apart.
0
0.34
2019
Two modes of recognition: algebra, coalgebra, and languages.
0
0.34
2019
Behavioural equivalences for timed systems.
0
0.34
2019
Communications in Choreographies, Revisited.
0
0.34
2018
Better Late Than Never: A Fully Abstract Semantics for Classical Processes
0
0.34
2018
Choreographies meet Communication Failures.
0
0.34
2017
Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation.
0
0.34
2017
Endofunctors modelling higher-order behaviours.
0
0.34
2016
Stratifying Semantic Data for Citation and Trust: An Introduction to RDFDF.
0
0.34
2016
A Specification of Open Transactional Memory for Haskell.
0
0.34
2016
Well-Stratified Linked Data for Well-Behaved Data Citation.
0
0.34
2016
A Uniform Framework for Timed Automata.
3
0.41
2016
On the Bisimulation Hierarchy of State-to-Function Transition Systems.
0
0.34
2016
Distributed execution of bigraphical reactive systems.
3
0.44
2015
Multi-Agent Systems Design And Prototyping With Bigraphical Reactive Systems
12
0.61
2014
Behavioural equivalences for coalgebras with unobservable moves.
6
0.47
2014
Weak bisimulations for labelled transition systems weighted over semirings.
8
0.46
2013
1
