On the public citation graph

The Book of Traces

https://doi.org/10.1142/2563
0 signed · 486 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 points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4643578openalex-extracted
inferred← citeshttps://doi.org/10.1002/9781119357056.ch4openalex-snapshot
Incremental Verification and Coverage Analysis of Strongly Distributed Systems
inferred← citeshttps://doi.org/10.1002/stvr.1543openalex-snapshot
Model‐based testing for concurrent systems with labelled event structures
inferred← citeshttps://doi.org/10.1002/stvr.280openalex-snapshot
Improved verification of linear‐time properties within fairness: weakly continuation‐closed behaviour abstractions computed from trace reductions
inferred← citeshttps://doi.org/10.1002/stvr.349openalex-snapshot
A theory of regression testing for behaviourally compatible object types
inferred← citeshttps://doi.org/10.1006/inco.1999.2847openalex-snapshot
Model-Checking of Correctness Conditions for Concurrent Objects
inferred← citeshttps://doi.org/10.1006/inco.2000.2924openalex-snapshot
Synchronization Languages and Rewriting Systems
inferred← citeshttps://doi.org/10.1006/inco.2001.2956openalex-snapshot
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1006/jcss.2001.1817openalex-snapshot
LTL Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/1-4020-2547-5_2openalex-snapshot
Generalizations and extensions of the möbius function
inferred← citeshttps://doi.org/10.1007/11505877_31openalex-snapshot
The Inclusion Problem for Unambiguous Rational Trace Languages
inferred← citeshttps://doi.org/10.1007/11539452_40openalex-snapshot
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/11549345_59openalex-snapshot
Concurrent Automata vs. Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/11590156_16openalex-snapshot
The MSO Theory of Connectedly Communicating Processes
inferred← citeshttps://doi.org/10.1007/11672142_56openalex-snapshot
Weighted Asynchronous Cellular Automata
inferred← citeshttps://doi.org/10.1007/11753728_25openalex-snapshot
Weighted Logics for Traces
inferred← citeshttps://doi.org/10.1007/11753728_8openalex-snapshot
Unfolding Synthesis of Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/11767589_6openalex-snapshot
The Synthesis Problem of Netcharts
inferred← citeshttps://doi.org/10.1007/11817949_31openalex-snapshot
On Interleaving in Timed Automata
inferred← citeshttps://doi.org/10.1007/11817963_30openalex-snapshot
Causal Atomicity
inferred← citeshttps://doi.org/10.1007/11821069_26openalex-snapshot
Partially Commutative Inverse Monoids
inferred← citeshttps://doi.org/10.1007/11841883_5openalex-snapshot
Automata on Directed Graphs: Edge Versus Vertex Marking
inferred← citeshttps://doi.org/10.1007/11901914_37openalex-snapshot
The Implementation of Mazurkiewicz Traces in POEM
inferred← citeshttps://doi.org/10.1007/11921240_8openalex-snapshot
Stronger Reduction Criteria for Local First Search
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_26openalex-snapshot
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_6openalex-snapshot
Local Normal Forms for Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_19openalex-snapshot
Calculating Church-Rosser Proofs in Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_41openalex-snapshot
Decidable Theories of Cayley-Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44464-5_14openalex-snapshot
On Model Checking Synchronised Hardware Circuits
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_36openalex-snapshot
Regular Collections of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_31openalex-snapshot
Pomsets for Local Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_37openalex-snapshot
Synthesizing Distributed Finite-State Systems from MSCs
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_38openalex-snapshot
Emptiness Is Decidable for Asynchronous Cellular Machines
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_23openalex-snapshot
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_27openalex-snapshot
Local First Search — A New Paradigm for Partial Order Reductions
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_49openalex-snapshot
A New Equational Foundation for the Fluent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45005-x_5openalex-snapshot
A Remark about Quadratic Trace Equations
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_12openalex-snapshot
Generating Series of the Trace Group
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_55openalex-snapshot
Infinite Series-Parallel Posets: Logic and Languages
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_57openalex-snapshot
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_22openalex-snapshot
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_64openalex-snapshot
On the Theory of One-Step Rewriting in Trace Monoids
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_79openalex-snapshot
Complete and Tractable Local Linear Time Temporal Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_80openalex-snapshot
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_5openalex-snapshot
HMSCs as Partial Specifications...with PNs as Completions
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_4openalex-snapshot
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_14openalex-snapshot
Regular Event Structures and Finite Petri Nets: A Conjecture
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_2openalex-snapshot
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_39openalex-snapshot
On the Average Parallelism in Trace Monoids
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_41openalex-snapshot
Existential and Positive Theories of Equations in Graph Products
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_43openalex-snapshot
Recognizable Sets of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_10openalex-snapshot
Explicit Modeling of Influences, and of Their Absence, in Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_27openalex-snapshot
Black Box Unfolding with Local First Search
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_17openalex-snapshot
Dynamic Bounds and Transition Merging for Local First Search
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_12openalex-snapshot
On Recognizable Stable Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_47openalex-snapshot
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_12openalex-snapshot
An Expressive Extension of TLC
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_5openalex-snapshot
Product Interval Automata: A Subclass of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_35openalex-snapshot
A persistent-Set Approach to Abstract State-Space Construction in Verification
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_20openalex-snapshot
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_14openalex-snapshot
Integrating formal description techniques
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_14openalex-snapshot
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_36openalex-snapshot
A Truly Concurrent Semantics for a Simple Parallel Programming Language
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_45openalex-snapshot
Solvability of Equations in Free Partially Commutative Groups Is decidable
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_49openalex-snapshot
The Star Problem in Trace Monoids: Reductions Beyond C4
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_20openalex-snapshot
On recognizable languages in divisibility monoids
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_38openalex-snapshot
Generalized synchronization languages
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_11openalex-snapshot
Complexity Results for Confluence Problems
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_8openalex-snapshot
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_44openalex-snapshot
A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_45openalex-snapshot
Two Techniques in the Area of the Star Problem
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_19openalex-snapshot
Matching Specifications for Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_90openalex-snapshot
On codings of traces
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_203openalex-snapshot
Semi-trace morphisms and rational transductions
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_9openalex-snapshot
On efficient reduction algorithms for some trace rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_59openalex-snapshot
A domain for concurrent termination a generalization of Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_149openalex-snapshot
On congruences and partial orders
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_152openalex-snapshot
Modular constructions of distributing automata
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_47openalex-snapshot
Efficient rewriting in cograph trace monoids
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_71openalex-snapshot
On the synchronization of semi-traces
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_23openalex-snapshot
Trace rewriting: Computing normal forms in time O(n log n)
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_41openalex-snapshot
Languages and logical definability in concurrency monoids
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_140openalex-snapshot
Linear time temporal logics over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_79openalex-snapshot
Towards automata for branching time and partial order
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_14openalex-snapshot
Processes in cause-effect structures
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_25openalex-snapshot
Some decision problems for traces
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_190openalex-snapshot
Solving trace equations using lexicographical normal forms
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_20openalex-snapshot
Rewriting rules for synchronization languages
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_24openalex-snapshot
Distributed versions of linear time temporal logic: A trace perspective
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_4openalex-snapshot
True versus artificial concurrency
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_15openalex-snapshot
Diagnosis with Petri Net Unfoldings
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_7openalex-snapshot
An Overview of Synchronous Communication for Control of Decentralized Discrete-Event Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3143-9_5openalex-snapshot
LTrL-Based Model Checking for a Restricted Class of Signal Transition Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_32openalex-snapshot
Two-Head Finite-State Acceptors with Translucent Letters
inferred← citeshttps://doi.org/10.1007/978-3-030-20461-7_10openalex-snapshot
Processes in Elementary Cause-Effect Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-20461-7_11openalex-snapshot
Monoid of Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_21openalex-snapshot
The Subtrace Order and Counting First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-60327-4_17openalex-snapshot
Drawing the Line: Basin Boundaries in Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_21openalex-snapshot
Deterministic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-78163-7_18openalex-snapshot
A Logic-Based Approach to Incremental Reasoning on Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-79121-6_5openalex-snapshot
The Commutative Closure of Shuffle Languages over Group Languages is Regular
inferred← citeshttps://doi.org/10.1007/978-3-030-88813-8_2openalex-snapshot
Basic Concepts of Cause-Effect Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-93489-7_5openalex-snapshot
Commutative Regular Languages with Product-Form Minimal Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_35openalex-snapshot
Ultimate GemCutter and the Axes of Generalization
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_8openalex-snapshot
Interval Traces with Mutex Relation
inferred← citeshttps://doi.org/10.1007/978-3-031-36021-3_57openalex-snapshot
Parallel Algorithm for Concurrent Integration of Three-Dimensional B-Spline Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_15openalex-snapshot
Second-Order Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_6openalex-snapshot
Commutativity for Concurrent Program Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_23openalex-snapshot
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_1openalex-snapshot
Context-Free Languages of String Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_6openalex-snapshot
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-97100-6_13openalex-snapshot
On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_24openalex-snapshot
Disjointness, Inclusion, and Regularity of $$\omega $$-Rational Trace Languages – Extended Abstract –
inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_14openalex-snapshot
Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_19openalex-snapshot
From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_4openalex-snapshot
Aligning Observed Timed Traces with Timed Stochastic Models
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_1openalex-snapshot
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_5openalex-snapshot
The Shuffle Product: New Research Directions
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_54openalex-snapshot
Order Structures for Subclasses of Generalised Traces
inferred← citeshttps://doi.org/10.1007/978-3-319-17581-2_6openalex-snapshot
A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_6openalex-snapshot
On Distributed Monitoring and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_9openalex-snapshot
Independence Abstractions and Models of Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_18openalex-snapshot
The Transformation Monoid of a Partially Lossy Queue
inferred← citeshttps://doi.org/10.1007/978-3-319-72023-4_8openalex-snapshot
Distributed Shared Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-90023-0_10openalex-snapshot
Analysis of Process Traces for Mapping Dynamic KPN Applications to MPSoCs
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_14openalex-snapshot
Word Equations over Graph Products
inferred← citeshttps://doi.org/10.1007/978-3-540-24626-8_22openalex-snapshot
Predictable Component Architectures Using Dependent Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24650-3_2openalex-snapshot
Coevolution of Algorithms and Deterministic Solution of Equations in Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_27openalex-snapshot
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-24704-3_6openalex-snapshot
On Testing Partially Specified IOTS through Lossless Queues
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_7openalex-snapshot
The Pros and Cons of Netcharts
inferred← citeshttps://doi.org/10.1007/978-3-540-30555-2_34openalex-snapshot
Supporting Partial Component Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_21openalex-snapshot
Composition and Decomposition in True-Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_13openalex-snapshot
How to Fix It: Using Fixpoints in Different Contexts
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_37openalex-snapshot
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_15openalex-snapshot
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_2openalex-snapshot
Synthesis of Distributed Algorithms Using Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_30openalex-snapshot
On the Confluence of Trace Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_33openalex-snapshot
A Kleene Iteration for Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_18openalex-snapshot
Modelling Concurrency with Quotient Monoids
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_19openalex-snapshot
Labeled Step Sequences in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_10openalex-snapshot
Architecture-Based Reasoning About Performability in Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_79openalex-snapshot
Parameterised Extra-Functional Prediction of Component-Based Control Systems – Industrial Experience
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_18openalex-snapshot
When Does Partial Commutative Closure Preserve Regularity?
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_10openalex-snapshot
Causal Dataflow Analysis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-72031-7_27openalex-snapshot
The Solution Space of Sorting by Reversals
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_5openalex-snapshot
Weighted Distributed Systems and Their Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_1openalex-snapshot
On First-Order Fragments for Words and Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_32openalex-snapshot
A Star Operation for Star-Free Trace Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_22openalex-snapshot
Capturing Conflict and Confusion in CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_27openalex-snapshot
Parametric and Sliced Causality
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_11openalex-snapshot
A Nice Labelling for Tree-Like Event Structures of Degree 3
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_12openalex-snapshot
Causal Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_26openalex-snapshot
Efficient Computation in Groups Via Compression
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_23openalex-snapshot
Synthesis of Safe Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_27openalex-snapshot
Token-Free Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_21openalex-snapshot
Dynamic Partial Order Reduction Using Probe Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_7openalex-snapshot
Semantics of Deterministic Shared-Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_41openalex-snapshot
MSO Logic for Unambiguous Shared-Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_29openalex-snapshot
Characterization of Star-Connected Languages Using Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-88479-8_44openalex-snapshot
Static Partial-Order Reduction of Concurrent Systems in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_7openalex-snapshot
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_10openalex-snapshot
Traces, Series-Parallel Posets, and Pictures: A Weighted Study
inferred← citeshttps://doi.org/10.1007/978-3-642-02478-8_63openalex-snapshot
Permutation Languages in Formal Linguistics
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_20openalex-snapshot
Closure Operators for Order Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_9openalex-snapshot
Distributed Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_30openalex-snapshot
Post Correspondence Problem with Partially Commutative Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_39openalex-snapshot
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_4openalex-snapshot
Analysis of Communicating Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_5openalex-snapshot
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14390-8_11openalex-snapshot
Graph Grammar Based Petri Nets Model of Concurrency for Self-adaptive hp-Finite Element Method with Rectangular Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_4openalex-snapshot
Taming Distributed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_3openalex-snapshot
Synthesis: Words and Traces
inferred← citeshttps://doi.org/10.1007/978-3-642-16181-0_4openalex-snapshot
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_15openalex-snapshot
Symbolic Dynamics, Flower Automata and Infinite Traces
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_34openalex-snapshot
An Automata-Theoretical Characterization of Context-Free Trace Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_24openalex-snapshot
On Model-Based Regression Testing of Web-Services Using Dependency Analysis of Visual Contracts
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_25openalex-snapshot
Shared-Memory Systems and Charts
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_19openalex-snapshot
Singular Artin Monoids of Finite Coxeter Type Are Automatic
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_31openalex-snapshot
Globally Deterministic CD-Systems of Stateless R(1)-Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22600-7_19openalex-snapshot
Kleene Theorems for Product Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22600-7_2openalex-snapshot
On Restarting Automata with Window Size One
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_15openalex-snapshot
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_15openalex-snapshot
An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_1openalex-snapshot
Performance Evaluation of Schedulers in a Probabilistic Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-25535-9_7openalex-snapshot
Decidability Results for Choreography Realization
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_8openalex-snapshot
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_46openalex-snapshot
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_30openalex-snapshot
Modeling Interval Order Structures with Partially Commutative Monoids
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_6openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-34732-0_15openalex-snapshot
Partial Commutation on Array Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_23openalex-snapshot
Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_6openalex-snapshot
Causality in Extensions of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_26openalex-snapshot
Asynchronous Games over Tree Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_61openalex-snapshot
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-40579-2_11openalex-snapshot
The Lexicographic Cross-Section of the Plactic Monoid Is Regular
inferred← citeshttps://doi.org/10.1007/978-3-642-40793-2_22openalex-snapshot
Characterization of Failure Effects on AADL Models
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_41openalex-snapshot
Learning Regular Languages over Large Alphabets
showing the first 200 of 486 · page through all 486
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.