On the public citation graph
COSY ? a system specification language based on paths and processes
0 signed · 107 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08934-9_99openalex-snapshot
Synchronic aspects of data types : Construction of a non-algorithmic solution of the Banker's problem
inferredcites →https://doi.org/10.1007/3-540-09541-1_21openalex-snapshot
On the abstract specification and formal analysis of synchronization properties of concurrent systems
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/bf00264467openalex-snapshot
Some extended semaphore primitives
inferredcites →https://doi.org/10.1007/bf00264564openalex-snapshot
Formal semantics of a class of high-level primitives for coordinating concurrent processes
inferredcites →https://doi.org/10.1007/bfb0029355openalex-snapshot
The specification of process synchronization by path expressions
inferredcites →https://doi.org/10.1016/0020-0190(78)90082-0openalex-snapshot
A general mechanism for avoiding starvation with distributed control
inferredcites →https://doi.org/10.1145/361268.361277openalex-snapshot
Synchronization of communicating processes
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/800233.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.1145/942572.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.1145/954587.954591openalex-snapshot
Abstract specification of resource accessing disciplines
inferredcites →https://doi.org/10.1184/r1/6606470openalex-snapshot
Information distribution aspects of design methodology
inferredcites →https://doi.org/10.21236/ad0704796openalex-snapshot
RESEARCH IN MACHINE-INDEPENDENT SOFTWARE PROGRAMMING. TASK AREA II. EVENTS AND CONDITIONS: AN APPROACH TO THE DESCRIPTION AND ANALYSIS OF DYNAMIC SYSTEMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_46openalex-snapshot
A formal semantics for concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_21openalex-snapshot
On the abstract specification and formal analysis of synchronization properties of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_16openalex-snapshot
Specification of highly parallel and distributed resource management
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_46openalex-snapshot
Design and analysis of highly parallel and distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_95openalex-snapshot
Formal behavioural specification of concurrent systems without globality assumptions
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_38openalex-snapshot
On the Merlin-Randell problem of train journeys
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_3openalex-snapshot
Specification languages for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_24openalex-snapshot
A formal proof system for infinitary rational expressions
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-16047-7_35openalex-snapshot
From state machines to temporal logic: Specification methods for protocol standards
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_33openalex-snapshot
COSY: Its relation to nets and to CSP
inferred← citeshttps://doi.org/10.1007/3-540-49654-8_1openalex-snapshot
Context and Caterpillars and Structured Documents
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_22openalex-snapshot
OBJSA Nets: a class of high-level nets having objects as domains
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_59openalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_26openalex-snapshot
Descriptive and analytical process algebras
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_80openalex-snapshot
From trace specifications to process terms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_6openalex-snapshot
A Polynomial Algorithm to Compute the Concurrency Relation of a Regular STG
inferred← citeshttps://doi.org/10.1007/978-1-4757-6541-0_7openalex-snapshot
OBJSA Nets: OBJ and Petri Nets for Specifying Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_1openalex-snapshot
Petri Net Distributability
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_20openalex-snapshot
An Introduction to the Macro Cosy Notation
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_15openalex-snapshot
Systematic Derivation of Communicating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_2openalex-snapshot
Distributed Systems, Partial Orderings of Events, and Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-84524-6_6openalex-snapshot
OBJSA Nets: A Class of High-level Nets Having Objects as Domains
inferred← citeshttps://doi.org/10.1007/978-94-009-7760-0_25openalex-snapshot
Synchronization of Concurrent Processes without Globality Assumptions
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferred← citeshttps://doi.org/10.1007/bf00262973openalex-snapshot
Synchronized behaviours of processes and rational relations
inferred← citeshttps://doi.org/10.1007/bf00267866openalex-snapshot
The Merlin-Randell problem of train journeys
inferred← citeshttps://doi.org/10.1007/bf00290705openalex-snapshot
A formal semantics for concurrent systems with a priority relation
inferred← citeshttps://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferred← citeshttps://doi.org/10.1007/bfb0013035openalex-snapshot
Strong bisimilarity on nets: A new concept for comparing net semantics
inferred← citeshttps://doi.org/10.1007/bfb0017129openalex-snapshot
On models and algebras for concurrent processes
inferred← citeshttps://doi.org/10.1007/bfb0022534openalex-snapshot
Verifying concurrent system specifications in COSY
inferred← citeshttps://doi.org/10.1007/bfb0028836openalex-snapshot
Partial ordering derivations for CCS
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90079-6openalex-snapshot
Towards a formal proof system for ω-rational expressions
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferred← citeshttps://doi.org/10.1016/0096-0551(83)90015-2openalex-snapshot
Message oriented programming—A resource based methodology
inferred← citeshttps://doi.org/10.1016/0164-1212(89)90038-1openalex-snapshot
Synchronizing events in replicated systems
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90002-8openalex-snapshot
A methodology for programming with concurrency: An informal presentation
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90020-2openalex-snapshot
Adequacy properties of path programs
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90128-2openalex-snapshot
Languages infinitaires et produit de mixage
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90029-5openalex-snapshot
Transforming sequential systems into concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90177-5openalex-snapshot
Concurrent and maximally concurrent evolution of nonsequential systems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90390-nopenalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90339-hopenalex-snapshot
Concurrent regular expressions and their relationship to Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00136-7openalex-snapshot
Compilation of the ELECTRE reactive language into finite transition systems
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90032-5openalex-snapshot
Understanding process structure diagrams
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90033-6openalex-snapshot
From information system requirements to designs: A mapping framework
inferred← citeshttps://doi.org/10.1016/0376-5075(82)90112-xopenalex-snapshot
Modeling and analysis of communication and cooperation protocols using petri net based models
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90013-fopenalex-snapshot
A fully parallel algorithm for implementing path expressions
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50018-xopenalex-snapshot
APPLICATION OF FORMAL LANGUAGE THEORY TO PROBLEMS OF SECURITY AND SYNCHRONIZATION11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79–04012.
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50030-7openalex-snapshot
Formal treatment of concurrency and time
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50020-5openalex-snapshot
Trace-Oriented Models of Concurrency
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00006-3openalex-snapshot
Nivat's processes and their synchronization
inferred← citeshttps://doi.org/10.1049/ip-sen:20000572openalex-snapshot
Analysis, Prediction, Template Toolkit (APTT) for object-based computation
inferred← citeshttps://doi.org/10.1109/32.295893openalex-snapshot
QDA-a method for systematic informal program analysis
inferred← citeshttps://doi.org/10.1109/32.56100openalex-snapshot
Specifying Ada server tasks with executable formal grammars
inferred← citeshttps://doi.org/10.1109/ada.1988.4794openalex-snapshot
Generating multitasking Ada programs from high-level specifications
inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17161openalex-snapshot
Incorporating transactions in a requirement engineering method
inferred← citeshttps://doi.org/10.1109/cmpsac.1991.170171openalex-snapshot
ParC project: practical constructs for parallel programming languages
inferred← citeshttps://doi.org/10.1109/dcs.1988.12536openalex-snapshot
Toward automating analysis support for developers of distributed software
inferred← citeshttps://doi.org/10.1109/emwrt.1990.128232openalex-snapshot
Realtime system control by means of path expressions
inferred← citeshttps://doi.org/10.1109/icassp.1983.1171942openalex-snapshot
A common operational software (ACOS) approach to a signal processing development system
inferred← citeshttps://doi.org/10.1109/icci.1992.227675openalex-snapshot
On operational equivalence of COSY programs
inferred← citeshttps://doi.org/10.1109/icse.1988.93709openalex-snapshot
An operational requirement description model for open systems
inferred← citeshttps://doi.org/10.1109/icse.1989.714440openalex-snapshot
Timing Analysis Of Cyclic Concurrent Programs
inferred← citeshttps://doi.org/10.1109/mc.1986.1663149openalex-snapshot
Supersystem Programming with Model
inferred← citeshttps://doi.org/10.1109/tcom.1982.1095451openalex-snapshot
From State Machines to Temporal Logic: Specification Methods for Protocol Standards
inferred← citeshttps://doi.org/10.1109/tse.1983.235581openalex-snapshot
Distributed Software System Design Representation Using Modified Petri Nets
inferred← citeshttps://doi.org/10.1109/tse.1986.6312944openalex-snapshot
Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems
inferred← citeshttps://doi.org/10.1145/100348.100367openalex-snapshot
Specifying and automatically generating Ada tasks in Prolog
inferred← citeshttps://doi.org/10.1145/23005.24038openalex-snapshot
A model for distributed systems based on graph rewriting
inferred← citeshttps://doi.org/10.1145/318593.318616openalex-snapshot
What it means for a concurrent program to satisfy a specification
inferred← citeshttps://doi.org/10.1145/324634.325389openalex-snapshot
Formal specification of N-modular redundancy
inferred← citeshttps://doi.org/10.1145/3764860.3768330openalex-snapshot
Path Expressions Revisited - Towards Compiler-enforced Reusable Synchronization Patterns
inferred← citeshttps://doi.org/10.1145/3916.3989openalex-snapshot
Describing and analyzing distributed software system designs
inferred← citeshttps://doi.org/10.1145/44501.44502openalex-snapshot
Constrained expressions: toward broad applicability of analysis methods for distributed software systems
inferred← citeshttps://doi.org/10.1145/74587.74629openalex-snapshot
Timing analysis of cyclic concurrent programs
inferred← citeshttps://doi.org/10.1145/75308.75323openalex-snapshot
Experiments in automated analysis of concurrent software systems
inferred← citeshttps://doi.org/10.1145/75309.75323openalex-snapshot
Experiments in automated analysis of concurrent software systems
inferred← citeshttps://doi.org/10.1145/954312.954317openalex-snapshot
Synchronization of concurrent processes without globality assumptions
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i6/82655openalex-snapshot
Concurrency in Intuitionistic Linear-Time μ-Calculus: A Case study of Manufacturing System
inferred← citeshttps://doi.org/10.3233/fi-1999-402302openalex-snapshot
The AltaRica Formalism for Describing Concurrent Systems
inferred← citeshttps://doi.org/10.5555/55823.55852openalex-snapshot
An operational requirement description model for open systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.