Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2842853
Jump to:navigation, search

zbMath1270.68380MaRDI QIDQ2842853

Simona Orzan, Stefan Blom

Publication date: 16 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105803901

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)


Related Items

Unnamed Item, Equivalence checking 40 years after: a review of bisimulation tools, Cartesian difference categories, Computing maximal weak and other bisimulations, Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities, Unnamed Item, On the computational complexity of bisimulation, redux, Efficient Coalgebraic Partition Refinement



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2842853&oldid=15780174"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki