A resource-based prioritized bisimulation for real-time systems
From MaRDI portal
Publication:1333279
DOI10.1006/inco.1994.1066zbMath0942.68622OpenAlexW1981737360MaRDI QIDQ1333279
Publication date: 26 February 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_reports/560
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
Priority and abstraction in process algebra ⋮ A complete axiomatization of finite-state ACSR processes ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ Structure of concurrency ⋮ Priority as extremal probability ⋮ A process algebra with distributed priorities
This page was built for publication: A resource-based prioritized bisimulation for real-time systems
