On the public citation graph

The linear time — Branching time spectrum II

https://doi.org/10.1007/3-540-57208-2_6
0 signed · 700 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.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-15670-4_10openalex-snapshot
Lectures on a calculus for communicating systems
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/3-540-18088-5_8openalex-snapshot
Another look at abstraction in process algebra
inferredcites →https://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
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/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferredcites →https://doi.org/10.1007/bfb0084813openalex-snapshot
Multiway synchronization verified with coupled simulation
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(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(87)90052-1openalex-snapshot
On the consistency of Koomen's Fair Abstraction Rule
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/0304-3975(87)90117-4openalex-snapshot
Refusal testing
inferredcites →https://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/0890-5401(92)90013-6openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1017/s0960129500000189openalex-snapshot
Quantales, observational logic and process semantics
inferredcites →https://doi.org/10.1093/comjnl/30.6.498openalex-snapshot
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
inferredcites →https://doi.org/10.1109/lics.1992.185529openalex-snapshot
Equivalences on observable processes
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1137/0217073openalex-snapshot
Readies and Failures in the Algebra of Communicating Processes
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/4221.4249openalex-snapshot
Acceptance trees
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.22028/d291-26429openalex-snapshot
Report on the 5th International Workshop on the Semantics of Programming Languages in Bad Honnef : March 11-15, 1985

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4201825openalex-extracted
On Probabilistic Weak Bisimilarity
inferred← citeshttps://doi.org/10.2139/ssrn.4670463openalex-extracted
Analyzing Divergence for Nondeterministic Probabilistic Models
inferred← citeshttps://doi.org/10.1002/stvr.448openalex-snapshot
A formal framework to test soft and hard deadlines in timed systems
inferred← citeshttps://doi.org/10.1006/inco.1997.2634openalex-snapshot
The Difference between Splitting innandn+1
inferred← citeshttps://doi.org/10.1006/inco.1997.2645openalex-snapshot
An Equational Axiomatization for Multi-exit Iteration
inferred← citeshttps://doi.org/10.1006/inco.1997.2661openalex-snapshot
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
inferred← citeshttps://doi.org/10.1006/inco.1999.2818openalex-snapshot
Bisimilarity of Open Terms
inferred← citeshttps://doi.org/10.1006/inco.2001.2967openalex-snapshot
Vertical Implementation
inferred← citeshttps://doi.org/10.1006/inco.2001.3122openalex-snapshot
Simulation Preorder over Simple Process Algebras
inferred← citeshttps://doi.org/10.1006/jcss.1999.1643openalex-snapshot
Petri Nets and Regular Processes
inferred← citeshttps://doi.org/10.1006/jcss.1999.1663openalex-snapshot
Rooted Branching Bisimulation as a Congruence
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_31openalex-snapshot
A Generic Framework for Checking Semantic Equivalences Between Pushdown Automata and Finite-State Automata
inferred← citeshttps://doi.org/10.1007/10720327_13openalex-snapshot
The Replacement Operation for CCP Programs
inferred← citeshttps://doi.org/10.1007/10722599_15openalex-snapshot
Unwinding Possibilistic Security Properties
inferred← citeshttps://doi.org/10.1007/11516798_1openalex-snapshot
Protocol System Integration, Interface and Interoperability
inferred← citeshttps://doi.org/10.1007/11523468_61openalex-snapshot
A Finite Basis for Failure Semantics
inferred← citeshttps://doi.org/10.1007/11523468_98openalex-snapshot
Orthogonal Extensions in Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/11535294_2openalex-snapshot
Timed Equivalences for Timed Event Structures
inferred← citeshttps://doi.org/10.1007/11538394_25openalex-snapshot
From RosettaNet PIPs to BPEL Processes: A Three Level Approach for Business Protocols
inferred← citeshttps://doi.org/10.1007/11558590_21openalex-snapshot
An Organisation Infrastructure for Multi-agent Systems Based on Agent Coordination Contexts
inferred← citeshttps://doi.org/10.1007/11601548_18openalex-snapshot
Finite Equational Bases in Process Algebra: Results and Open Questions
inferred← citeshttps://doi.org/10.1007/11601548_4openalex-snapshot
A Characterisation of Weak Bisimulation Congruence
inferred← citeshttps://doi.org/10.1007/11603009_20openalex-snapshot
Is Timed Branching Bisimilarity an Equivalence Indeed?
inferred← citeshttps://doi.org/10.1007/11690634_1openalex-snapshot
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
inferred← citeshttps://doi.org/10.1007/11690634_18openalex-snapshot
Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics
inferred← citeshttps://doi.org/10.1007/11787006_41openalex-snapshot
On the Axiomatizability of Priority
inferred← citeshttps://doi.org/10.1007/11804192_10openalex-snapshot
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
inferred← citeshttps://doi.org/10.1007/11804192_14openalex-snapshot
Safety and Liveness in Concurrent Pointer Programs
inferred← citeshttps://doi.org/10.1007/11817949_13openalex-snapshot
Operational Determinism and Fast Algorithms
inferred← citeshttps://doi.org/10.1007/11817949_4openalex-snapshot
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
inferred← citeshttps://doi.org/10.1007/11817949_9openalex-snapshot
Liveness, Fairness and Impossible Futures
inferred← citeshttps://doi.org/10.1007/11821069_56openalex-snapshot
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
inferred← citeshttps://doi.org/10.1007/11901914_35openalex-snapshot
Sigref – A Symbolic Bisimulation Tool Box
inferred← citeshttps://doi.org/10.1007/11944836_23openalex-snapshot
Testing Probabilistic Equivalence Through Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_3openalex-snapshot
Congruent Weak Conformance, a Partial Order among Processes
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_3openalex-snapshot
Equivalence-Checking with Infinite-State Systems: Techniques and Results
inferred← citeshttps://doi.org/10.1007/3-540-44464-5_11openalex-snapshot
On Simulation-Checking with Sequential Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_19openalex-snapshot
Deriving Bisimulation Congruences for Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_22openalex-snapshot
Action Contraction
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_5openalex-snapshot
Process Algebra and Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_15openalex-snapshot
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
inferred← citeshttps://doi.org/10.1007/3-540-44830-6_11openalex-snapshot
Testing Transition Systems with Input and Output Testers
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_23openalex-snapshot
Bisimulation and the Reduction of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_28openalex-snapshot
Efficient Verification Algorithms for One-Counter Processes
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_9openalex-snapshot
Information Flow Control and Applications — Bridging a Gap —
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_50openalex-snapshot
Axiomatising Divergence
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_19openalex-snapshot
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_9openalex-snapshot
Testing Transition Systems: An Annotated Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_21openalex-snapshot
Observational Semantics for Timed Event Structures
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_29openalex-snapshot
P-Hardness of Equivalence Testing on Finite-State Processes
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_31openalex-snapshot
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_38openalex-snapshot
Undecidability of Weak Bisimilarity for Pushdown Processes
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_6openalex-snapshot
The Join Calculus: A Language for Distributed Mobile Programming
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_44openalex-snapshot
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_51openalex-snapshot
A Parametric Analysis of the State Explosion Problem in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_19openalex-snapshot
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_1openalex-snapshot
Norm Functions for Probabilistic Bisimulations with Delays
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_13openalex-snapshot
The State Explosion Problem from Trace to Bisimulation Equivalence
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_3openalex-snapshot
Verifying Performance Equivalence for Timed Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_28openalex-snapshot
Simulation and Bisimulation over One-Counter Processes
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_35openalex-snapshot
A Logical Viewpoint on Process-Algebraic Quotients
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_6openalex-snapshot
Testing Concurrent Systems: A Formal Approach
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_20openalex-snapshot
Modular Specification of Concurrent Systems with Observational Logic
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_47openalex-snapshot
Simulation Preorder on Simple Process Algebras
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_19openalex-snapshot
Consistency of Partial Process Specifications
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_71openalex-snapshot
Strong bisimilarity on nets revisited
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_126openalex-snapshot
Safety for branching time semantics
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_108openalex-snapshot
Experiments on processes with backtracking
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_39openalex-snapshot
A complete axiomatization for branching bisimulation congruence of finite-state behaviours
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_171openalex-snapshot
The complete axiomatization of Cs-congruence
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_5openalex-snapshot
Three metric domains of processes for bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_78openalex-snapshot
Synthesis algorithm for recursive processes by μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_206openalex-snapshot
High undecidability of weak bisimilarity for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_23openalex-snapshot
Fair testing
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_148openalex-snapshot
An elementary bisimulation decision procedure for arbitrary context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-60385-9_8openalex-snapshot
A foundation for formal reuse of hardware
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_4openalex-snapshot
Decidability results in automata and process theory
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_42openalex-snapshot
Test generation with inputs, outputs, and quiescence
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_3openalex-snapshot
Compositionality in state space verification methods
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_117openalex-snapshot
Algebraic characterizations of decorated trace equivalences over tree-like structures
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_151openalex-snapshot
On the complexity of relational problems for finite state processes
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_61openalex-snapshot
HORNSAT, model checking, verification and games
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_55openalex-snapshot
Decoding choice encodings
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_60openalex-snapshot
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_27openalex-snapshot
On implementations and semantics of a concurrent programming language
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_42openalex-snapshot
Weak semantics based on lighted button pressing experiments
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_20openalex-snapshot
Decidability and complexity of Petri net problems — An introduction
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_21openalex-snapshot
The state explosion problem
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_517openalex-snapshot
Behavioral Equivalences
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_4openalex-snapshot
Invited Address I
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_16openalex-snapshot
Quantified reduced views of state graphs using Markovian and timed observational equivalence
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_9openalex-snapshot
Modeling Basic LOTOS by FSMs for Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_24openalex-snapshot
A Methodology for the Description of System Requirements and the Derivation of Formal Specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-35562-7_18openalex-snapshot
A Junction Between State Based and Behavioural Specification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_7openalex-snapshot
Full Abstraction in Structural Operational Semantics (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_2openalex-snapshot
Simple Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_3openalex-snapshot
Symbolic Abstractions of Automata
inferred← citeshttps://doi.org/10.1007/978-1-4757-3540-6_8openalex-snapshot
Process Algebra and Equivalences
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4openalex-snapshot
A Process Algebraic Approach to Software Architecture Design
inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_11openalex-snapshot
Finite Observation Models
inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_13openalex-snapshot
The Algebra of CSP
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_14openalex-snapshot
A Note on Refinement in Hierarchical Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_7openalex-snapshot
Characterization and Verification of Stuttering Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-030-02146-7_1openalex-snapshot
What Good are Models?
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_14openalex-snapshot
Computing Coupled Similarity
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_7openalex-snapshot
Genesis and Evolution of ULTraS: Metamodel, Metaequivalences, Metaresults
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_2openalex-snapshot
Modal Open Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_1openalex-snapshot
Model Verification Through Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_12openalex-snapshot
Taming Concurrency for Verification Using Multiparty Session Types
inferred← citeshttps://doi.org/10.1007/978-3-030-44411-2_2openalex-snapshot
Coherent Resolutions of Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_1openalex-snapshot
An O(m log n) algorithm for branching bisimilarity on labelled transition systems
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_7openalex-snapshot
Trace Equivalence and Epistemic Logic to Express Security Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-59854-9_5openalex-snapshot
Alternative Characterizations of Probabilistic Trace Equivalences on Coherent Resolutions of Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_1openalex-snapshot
A Game for Linear-time–Branching-time Spectroscopy
inferred← citeshttps://doi.org/10.1007/978-3-030-73785-6_3openalex-snapshot
Towards General Axiomatizations for Bisimilarity and Trace Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_14openalex-snapshot
Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-030-88494-9_12openalex-snapshot
Differential Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_19openalex-snapshot
Data and Process Resonance
inferred← citeshttps://doi.org/10.1007/978-3-031-15008-1_15openalex-snapshot
A Multi-level Methodology for Behavioral Comparison of Software-Intensive Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_21openalex-snapshot
On Probabilistic Extension of the Interaction Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-20872-0_10openalex-snapshot
Decompositional Branching Bisimulation Minimisation of Monolithic Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_27openalex-snapshot
Retracing Some Paths in Categorical Semantics: From Process-Propositions-as-Types to Categorified Reals and Computers
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_24openalex-snapshot
Just Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_3openalex-snapshot
There and Back Again
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_5openalex-snapshot
Process Equivalence Problems as Energy Games
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_10openalex-snapshot
It’s All a Game
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_13openalex-snapshot
Relating Apartness and Branching Bisimulation Games
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_8openalex-snapshot
Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-66438-0_3openalex-snapshot
Preorder-Constrained Simulations for Program Refinement with Effects
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_8openalex-snapshot
Towards a Formal Testing Theory for Quantum Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-75775-4_16openalex-snapshot
Model Checking and Strategy Synthesis with Abstractions and Certificates
inferred← citeshttps://doi.org/10.1007/978-3-032-02929-4_5openalex-snapshot
Comparing Apples with Oranges: An Assessment Framework for Model-System Similarity
inferred← citeshttps://doi.org/10.1007/978-3-032-20684-8_2openalex-snapshot
The Queue Automaton Revisited
inferred← citeshttps://doi.org/10.1007/978-3-032-20684-8_9openalex-snapshot
Deciding Impossible Futures
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_9openalex-snapshot
Rely-Guarantee Is Coinductive
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_23openalex-snapshot
Faster Signature Refinement for Branching Bisimilarity Minimization
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_15openalex-snapshot
Certifiably Sound Parallelizing Transformations
inferred← citeshttps://doi.org/10.1007/978-3-319-05032-4_8openalex-snapshot
A Supervisor Synthesis Tool for Finite Nondeterministic Automata with Data
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_7openalex-snapshot
Attractor Equivalence: An Observational Semantics for Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-10696-0_23openalex-snapshot
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_4openalex-snapshot
Compositional Verification of Asynchronously Communicating Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_7openalex-snapshot
Skipping Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-24457-0_1openalex-snapshot
Automatic Refinement Checking for Formal System Models
inferred← citeshttps://doi.org/10.1007/978-3-319-25037-3_3openalex-snapshot
Process Matching Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_5openalex-snapshot
The Proof Technique of Unique Solutions of Contractions
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_15openalex-snapshot
Global Protocol Implementations via Attribute-Based Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-28934-2_10openalex-snapshot
k-Bisimulation: A Bisimulation for Measuring the Dissimilarity Between Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_32openalex-snapshot
On the Executability of Interactive Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-41480-5_4openalex-snapshot
Verification of Vertical Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_13openalex-snapshot
Distributed Computation of Fixed Points on Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49148-6_8openalex-snapshot
Computation of Secure Consistency for Real Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_14openalex-snapshot
A Branching Time Model of CSP
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_6openalex-snapshot
Abstractions for Transition Systems with Applications to Stubborn Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_5openalex-snapshot
A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_4openalex-snapshot
Logical Characterisation of Parameterised Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_9openalex-snapshot
Tests and Refutation
inferred← citeshttps://doi.org/10.1007/978-3-319-68270-9_5openalex-snapshot
On the Existence of Practical Testers
inferred← citeshttps://doi.org/10.1007/978-3-319-68972-2_14openalex-snapshot
Automatic Transition System Model Identification for Network Applications from Packet Traces
inferred← citeshttps://doi.org/10.1007/978-3-319-69904-2_11openalex-snapshot
Querying Graph Databases: What Do Graph Patterns Mean?
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_12openalex-snapshot
Logics for Bisimulation and Divergence
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_5openalex-snapshot
Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_24openalex-snapshot
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_17openalex-snapshot
The Influence of Durational Actions on Time Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-30233-9_12openalex-snapshot
Branching Time Equivalences for Interactive Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_5openalex-snapshot
A Test Generation Framework for quiescent Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31984-9_3openalex-snapshot
Analyzing Web Service Based Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-32258-0_12openalex-snapshot
Agent Interaction Semantics by Timed Operating Instructions
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_14openalex-snapshot
Adding Action Refinement to Stochastic True Concurrency Models
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_16openalex-snapshot
Comparison of Data and Process Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_16openalex-snapshot
Equivalence Checking of Non-flat Systems Is EXPTIME-Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot
Comparative Branching-Time Semantics for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_5openalex-snapshot
Syntactic Formats for Free
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_31openalex-snapshot
Testing-Based Abstractions for Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_5openalex-snapshot
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_17openalex-snapshot
A Hierarchy of Equivalences for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_5openalex-snapshot
A Survey of Markovian Behavioral Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_10openalex-snapshot
New Bisimulation Semantics for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_65openalex-snapshot
Ready Simulation for Concurrency: It’s Logical!
inferred← citeshttps://doi.org/10.1007/978-3-540-73940-1_4openalex-snapshot
A Categorical Observation of Timed Testing Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_14openalex-snapshot
Is Observational Congruence Axiomatisable in Equational Horn Logic?
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_9openalex-snapshot
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_26openalex-snapshot
What Semantic Equivalences Are Suitable for Non-interference Properties in Computer Security
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_15openalex-snapshot
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_11openalex-snapshot
A Context-Free Process as a Pushdown Automaton
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_35openalex-snapshot
A Rule Format for Associativity
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_38openalex-snapshot
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_3openalex-snapshot
The Three Platonic Models of Divergence-Strict CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-89287-8_3openalex-snapshot
Teaching Concurrency Concepts to Freshmen
inferred← citeshttps://doi.org/10.1007/978-3-540-89437-7_13openalex-snapshot
Behaviour Equivalences in Timed Distributed π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-93851-4_21openalex-snapshot
Goal-Equivalent Secure Business Process Re-engineering
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_18openalex-snapshot
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_35openalex-snapshot
Safe Reasoning with Logic LTS
inferred← citeshttps://doi.org/10.1007/978-3-642-00255-7_13openalex-snapshot
Modelling Divergence in Relational Concurrent Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-01918-0_1openalex-snapshot
Calculi for Service-Oriented Computing
showing the first 200 of 663
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.