Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68392OpenAlexW2495578842MaRDI QIDQ5431340

Sławomir Lasota

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

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)

Related Items (6)

The decidability border of hereditary history preserving bisimilarity ⋮ Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems ⋮ Undecidability of performance equivalence of Petri nets ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Non-interleaving bisimulation equivalences on basic parallel processes

This page was built for publication: Mathematical Foundations of Computer Science 2003