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

scientific article; zbMATH DE number 1522998

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

zbMATH Open0964.68089MaRDI QIDQ4511273FDOQ4511273


Authors: Mads Dam, Dilian Gurov Edit this on Wikidata


Publication date: 30 October 2000



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 3936485
  • scientific article; zbMATH DE number 1231562
  • Proving properties of dynamic process networks
  • A Proof System for Compositional Verification of Probabilistic Concurrent Processes
  • Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS


zbMATH Keywords

proof system


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)



Cited In (9)

  • Compositional checking of satisfaction
  • On process equivalence = equation solving in CCS
  • Title not available (Why is that?)
  • Planning proofs of equations in CCS
  • Unique fixpoint induction for message-passing process calculi
  • A logic for the specification and proof of regular controllable processes of CCS
  • Proving correctness of labeled transition systems by semantic tableaux
  • Title not available (Why is that?)
  • Reduced models for efficient CCS verification





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511273)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4511273&oldid=18609509"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 08:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki