Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Concurrency Based Transition Refinement for the Verification of Distributed Algorithms

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

DOI10.1007/978-3-540-40022-6_21zbMath1283.68212OpenAlexW1577329480MaRDI QIDQ5392171

Sibylle Peuker

Publication date: 8 April 2011

Published in: Petri Net Technology for Communication-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-40022-6_21



zbMATH Keywords

verificationpartial order semanticsdistributed algorithmsconcurrencyalgebraic Petri netsaction refinement


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)








This page was built for publication: Concurrency Based Transition Refinement for the Verification of Distributed Algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5392171&oldid=20118939"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 01:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki