On the public citation graph
Compositionality through an operational semantics of contexts
0 signed · 92 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferredcites →https://doi.org/10.1007/3-540-18088-5_11openalex-snapshot
Verifying a protocol using relativized bisimulation
inferredcites →https://doi.org/10.1007/3-540-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferredcites →https://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/j.jlap.2004.05.001openalex-snapshot
A structural approach to operational semantics
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_29openalex-snapshot
New Insights on Architectural Connectors
inferred← citeshttps://doi.org/10.1007/11548133_7openalex-snapshot
Complete Axioms for Stateless Connectors
inferred← citeshttps://doi.org/10.1007/11560647_9openalex-snapshot
Compositionality of Fixpoint Logic with Chop
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_20openalex-snapshot
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_31openalex-snapshot
Open Ended Systems, Dynamic Bisimulation and Tile Logic
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_18openalex-snapshot
Bisimulation by Unification*
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_4openalex-snapshot
Logical Specification of Operational Semantics
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_2openalex-snapshot
Tile transition systems as structured coalgebras?
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_76openalex-snapshot
Compositional theories based on an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_21openalex-snapshot
On the complexity of equation solving in process algebra
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_49openalex-snapshot
Expressiveness results for process algebras
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_4openalex-snapshot
A practical technique for process abstraction
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_103openalex-snapshot
Automatic synthesis of real time systems
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_8openalex-snapshot
A front-end generator for verification tools
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_27openalex-snapshot
Mapping tile logic into rewriting logic
inferred← citeshttps://doi.org/10.1007/978-0-387-35394-4_15openalex-snapshot
Solving asynchronous equations
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_10openalex-snapshot
Negative Results on Decidability and Small Model Property of Process Equations
inferred← citeshttps://doi.org/10.1007/978-3-540-31794-4_1openalex-snapshot
Symbolic Equivalences for Open Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_11openalex-snapshot
On the Evolution of Reactive Components
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_5openalex-snapshot
Executable Tile Specifications for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_21openalex-snapshot
A Connector Algebra for P/T Nets Interactions
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_19openalex-snapshot
Specification in PDL with Recursion
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_7openalex-snapshot
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/bf01211907openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/bfb0023732openalex-snapshot
Compositional minimization of finite state systems
inferred← citeshttps://doi.org/10.1007/bfb0039050openalex-snapshot
Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
inferred← citeshttps://doi.org/10.1007/bfb0039079openalex-snapshot
On the compositional checking of validity
inferred← citeshttps://doi.org/10.1007/bfb0084799openalex-snapshot
Structural operational specifications and trace automata
inferred← citeshttps://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/s100090050032openalex-snapshot
Partial model checking of modal equations: A survey
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90163-copenalex-snapshot
Compositionality and bisimulation: a negative result
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90025-bopenalex-snapshot
A compositional protocol verification using relativized bisimulation
inferred← citeshttps://doi.org/10.1016/j.ic.2010.04.002openalex-snapshot
On hierarchically developing reactive systems
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104487openalex-snapshot
Logical vs. behavioural specifications
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.015openalex-snapshot
Incremental construction of systems: An efficient characterization of the lacking sub-system
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.044openalex-snapshot
Observational congruences for dynamically reconfigurable tile systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.005openalex-snapshot
A basic algebra of stateless connectors
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.004openalex-snapshot
A semantic framework for open processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.007openalex-snapshot
Complete proof systems for weighted modal logic
inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01157-7openalex-snapshot
Testing in context: framework and test derivation
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00030-1openalex-snapshot
Tiles, Rewriting Rules and CCS
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80697-8openalex-snapshot
Can Actors and π-Agents Live Together?
inferred← citeshttps://doi.org/10.1017/s0960129501003462openalex-snapshot
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
inferred← citeshttps://doi.org/10.1023/a:1022561505762openalex-snapshot
Modifying LOTOS Specifications by Means of Automatable Formula-Based Integrations
inferred← citeshttps://doi.org/10.1109/acsd.2014.14openalex-snapshot
Modular µ-Calculus Model-Checking with Formula-Dependent Hierarchical Abstractions
inferred← citeshttps://doi.org/10.1109/iain.2015.7352264openalex-snapshot
Characterization of Chip-Scale Atomic Clock for GNSS navigation solutions
inferred← citeshttps://doi.org/10.1109/isola.2006.71openalex-snapshot
Connecting Algebraic and Logical Descriptions of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1109/lics.1999.782620openalex-snapshot
Cartesian closed double categories, their lambda-notation, and the pi-calculus
inferred← citeshttps://doi.org/10.1145/127056.127092openalex-snapshot
Towards a type theory for active objects
inferred← citeshttps://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:16)2013openalex-snapshot
Connector algebras for C/E and P/T nets' interactions
inferred← citeshttps://doi.org/10.3233/fi-1998-341201openalex-snapshot
Parameterized Structured Operational Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.18.1openalex-snapshot
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0741openalex-snapshot
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
inferred← citeshttps://doi.org/10.5281/zenodo.41648openalex-snapshot
Making Better Biometric Decisions With Quality And Cohort Information : A Case Study In Fingerprint Verification
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v1i45.21597openalex-snapshot
Automatic Synthesis of Real Time Systems
inferred← citeshttps://doi.org/10.7146/brics.v2i19.19921openalex-snapshot
Compositional Model Checking of Real Time Systems
inferred← citeshttps://doi.org/10.7146/brics.v6i55.20125openalex-snapshot
Logical Specification of Operational Semantics
inferred← citeshttps://doi.org/10.7146/dpb.v21i417.6730openalex-snapshot
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
inferred← citeshttps://doi.org/10.7146/dpb.v22i457.6930openalex-snapshot
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
showing the first 75 of 76 · page through all 76
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.