COSY - a system specification language based on paths and processes

DOI10.1007/BF00266047MaRDI QIDQ1256313zbMATHOpenAlexFDO

Authors P. R. Torrigiani, Peter E. Lauer, Michael Shields

Publication date 1979

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

Concurrent ProcessCosyOperating SystemSystem Specification Language

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited in

(16)

• Concurrent regular expressions and their relationship to Petri nets
• The Merlin-Randell problem of train journeys
• Towards a formal proof system for \(\omega\)-rational expressions
• Synchronization trees
• On priority in COSY
• Transforming sequential systems into concurrent systems
• Compilation of the ELECTRE reactive language into finite transition systems
• A formal semantics for concurrent systems with a priority relation
• COSY
• Concurrent histories: a basis for observing distributed systems
• Correctness of concurrent processes
• Nivat's processes and their synchronization
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Adequacy properties of path programs
• Concurrent and maximally concurrent evolution of nonsequential systems
• Langages infinitaires et produit de mixage

This page was built for publication: COSY - a system specification language based on paths and processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256313)