A formal semantics for concurrent systems with a priority relation

DOI10.1007/BF00290705zbMath0589.68021MaRDI QIDQ1074338

Ryszard Janicki

Publication date: 1987

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

zbMATH Keywords

concurrent systemssemanticsCOSY path expressionsdeadlock-freenesspriority relationvector firing sequences

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (7)

On relating some models for concurrency ⋮ Causal behaviours and nets ⋮ On priority in COSY ⋮ Step semantics for ``true concurrency with recursion ⋮ Petri net semantics of priority systems ⋮ Modeling concurrency with interval traces ⋮ Structure of concurrency

Uses Software

• COSY
• Path Pascal

Cites Work

• Calculi for synchrony and asynchrony
• Adequacy properties of path programs
• Formal semantics of a class of high-level primitives of coordinating concurrent processes
• COSY - a system specification language based on paths and processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal semantics for concurrent systems with a priority relation