Representing CCS programs by finite predicate-transition nets

DOI10.1007/BF00277389zbMath0675.68035OpenAlexW2064243576MaRDI QIDQ1122360

Dirk Taubner

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00277389

zbMATH Keywords

interleaving semanticsrestrictionconcurrencyrenaminghidingCCS programsdistributed semanticsparallel synchronizationpredicate-transition net

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of software (68N01)

Related Items (2)

Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Nested-unit Petri nets

This page was built for publication: Representing CCS programs by finite predicate-transition nets