scientific article; zbMATH DE number 1988986

zbMath1023.68635MaRDI QIDQ4430315

G. De Michelis, Luca A. Castellano, Lucia Pomello

Publication date: 20 October 2003

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (17)

Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ Concurrent bisimulations in Petri nets ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Synchronous and asynchronous communication(s) between three parties ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ A\(^ 2\)CCS: Atomic actions for CCS ⋮ Diagnosis from scenarios ⋮ Fairness and partial order semantics ⋮ Bisimulation and action refinement ⋮ An algebra for process creation ⋮ Refinement of actions for real-time concurrent systems with causal ambiguity ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Synchronization languages and rewriting systems ⋮ Vertical implementation

This page was built for publication: