COSY - a system specification language based on paths and processes
From MaRDI portal
Publication:1256313
DOI10.1007/BF00266047zbMATH Open0403.68031OpenAlexW2006244393MaRDI QIDQ1256313FDOQ1256313
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
Cited In (16)
- A formal semantics for concurrent systems with a priority relation
- Concurrent histories: a basis for observing distributed systems
- Nivat's processes and their synchronization
- Concurrent regular expressions and their relationship to Petri nets
- Transforming sequential systems into concurrent systems
- Synchronization trees
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Langages infinitaires et produit de mixage
- COSY
- Correctness of concurrent processes
- On priority in COSY
- The Merlin-Randell problem of train journeys
- Towards a formal proof system for \(\omega\)-rational expressions
- Concurrent and maximally concurrent evolution of nonsequential systems
- Adequacy properties of path programs
- Compilation of the ELECTRE reactive language into finite transition systems
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)
