On the public citation graph

A general theory of action languages

0 signed · 54 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferredcites →https://doi.org/10.1007/3-540-10284-1openalex-snapshot
Algebraic semantics
inferredcites →https://doi.org/10.1007/3-540-18740-5_60openalex-snapshot
Algebras with approximation and recursive data structures
inferredcites →https://doi.org/10.1007/3-540-53982-4_17openalex-snapshot
A fully abstract model for concurrent constraint programming
inferredcites →https://doi.org/10.1007/3-540-57182-5_7openalex-snapshot
Action calculi, or syntactic action structures
inferredcites →https://doi.org/10.1007/3-540-61064-2_24openalex-snapshot
Semantics of interaction
inferredcites →https://doi.org/10.1007/3-540-61604-7_57openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1007/3-540-61735-3_11openalex-snapshot
A process algebra for synchronous concurrent constraint programming
inferredcites →https://doi.org/10.1007/978-1-4615-9050-7_1openalex-snapshot
Theory of Algorithms and Discrete Processors
inferredcites →https://doi.org/10.1007/978-3-642-85983-0_8openalex-snapshot
Concurrent Semantics for Concurrent Constraint Programs
inferredcites →https://doi.org/10.1007/bf01071436openalex-snapshot
Automata theory and structural design problems of digital machines
inferredcites →https://doi.org/10.1007/bf01074920openalex-snapshot
Algebras with approximation and recursive data structures
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0304-3975(97)00216-8openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1145/151233.151240openalex-snapshot
Elements of interaction
inferredcites →https://doi.org/10.1145/214037.214092openalex-snapshot
Interaction as a basis for empirical computer science
inferredcites →https://doi.org/10.1145/253769.253801openalex-snapshot
Why interaction is more powerful than algorithms
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
inferredcites →https://doi.org/10.1287/orms.2011.04.16openalex-snapshot
Constraint programming
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48738-1_15openalex-snapshot
Leveraging UML to Deliver Correct Telecom Applications
inferred← citeshttps://doi.org/10.1007/11506843_8openalex-snapshot
Semantics of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/978-3-031-14841-5_25openalex-snapshot
Algebraic Modeling of Molecular Interactions
inferred← citeshttps://doi.org/10.1007/978-3-319-03998-5_2openalex-snapshot
Theory of Interaction, Insertion Modeling, and Cognitive Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-24912-4_1openalex-snapshot
Insertion Modeling and Symbolic Verification of Large Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_18openalex-snapshot
A Model for Interaction of Agents and Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_4openalex-snapshot
Basic Protocols: Specification Language for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_23openalex-snapshot
Insertion Modeling System
inferred← citeshttps://doi.org/10.1007/978-3-642-34274-5_38openalex-snapshot
Insertion Cognitive Architecture
inferred← citeshttps://doi.org/10.1007/bf02666993openalex-snapshot
Theorem proving in a mathematical information environment
inferred← citeshttps://doi.org/10.1007/bf02733299openalex-snapshot
Deductive tools of an algebraic programming system
inferred← citeshttps://doi.org/10.1007/s10559-015-9691-3openalex-snapshot
Generating Symbolic Traces in the Insertion Modeling System
inferred← citeshttps://doi.org/10.1016/j.bica.2014.03.001openalex-snapshot
Theory of interaction, insertion modeling, and cognitive architectures
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.05.005openalex-snapshot
Basic protocols, message sequence charts, and the verification of requirements specifications
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00159-8openalex-snapshot
Probabilistic behaviours of reactive agents
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80590-0openalex-snapshot
Two semantics for Timed Default Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80608-5openalex-snapshot
The development of interactive algorithms for the Mathematical Environment
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80617-6openalex-snapshot
The development of interactive algorithms for the Mathematical Environment
inferred← citeshttps://doi.org/10.1023/a:1023812824070openalex-snapshot
Insertion Programming
inferred← citeshttps://doi.org/10.1023/b:casa.0000020220.16822.36openalex-snapshot
Verification of Software Requirements on Program Systems Represented by Attribute Transition Systems
inferred← citeshttps://doi.org/10.1109/cmpsac.2002.1044564openalex-snapshot
Requirement capturing and 3CR approach
inferred← citeshttps://doi.org/10.1109/icisct50599.2020.9351368openalex-snapshot
Formalization of Data Derivative Structures
inferred← citeshttps://doi.org/10.1109/tr.2017.2665164openalex-snapshot
An Approach for Identifying and Analyzing Implicit Interactions in Distributed Systems
inferred← citeshttps://doi.org/10.14308/ite000304openalex-snapshot
PROPAGATION-BASED CONSTRAINT SOLVER IN IMS
inferred← citeshttps://doi.org/10.15407/pp2022.03-04.117openalex-snapshot
Algebraic approach to the analysis of legal documents
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(5)openalex-snapshot
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(5)-1openalex-snapshot
Iformatics: Formation of computer software and technologies of software systems
inferred← citeshttps://doi.org/10.24251/hicss.2017.726openalex-snapshot
Identifying Implicit Component Interactions in Distributed Cyber-Physical Systems
inferred← citeshttps://doi.org/10.37394/23209.2023.20.44openalex-snapshot
Functional Programming of Intelligent Systems
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1000/icteri-2013-p-004-015-inv-3.pdfopenalex-snapshot
General Theory of Interaction and Cognitive Architectures
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1000/icteri-2013-p-565-572-smsv.pdfopenalex-snapshot
Implementation of Propagation-Based Constraint Solver in IMS
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-848/icteri-2012-ceur-ws-paper-46-p-102-111.pdfopenalex-snapshot
Combinatorial Strand Algebra in Insertion Modeling System
inferred← citeshttps://doi.org/10.71548/21556openalex-snapshot
On the Modelling, Analysis, and Mitigation of Distributed Covert Channels
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.