yusuke1997/dblp-id-title huggingface dataset:
A Calculus of Mobile Agents
Expectation in Stochastic Games with Prefix-Independent Objectives
Compositional Controller Synthesis for Stochastic Games
Up-To Techniques for Behavioural Metrics via Fibrations
Games Where You Can Play Optimally with Arena-Independent Finite Memory
Termination Problems in Chemical Kinetics
A Preorder for Partial Process Specifications
An Epistemic Perspective on Consistency of Concurrent Computations
Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility
Robust Controller Synthesis in Timed Automata
Tractability of Separation Logic with Inductive Definitions: Beyond Lists
On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
Nash Equilibrium and Bisimulation Invariance
Proof Graphs for Parameterised Boolean Equation Systems
Synthesis of Distributed Systems from Knowledge-Based Specifications
Partial Order Logics for Elementary Net Systems: State- and Event-approaches
Posets for Configurations!
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems
Strategy Improvement for Stochastic Rabin and Streett Games
Consistency in 3D
Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk)
On the Construction of Sorted Reactive Systems
Denotational Semantics for Probabilistic and Concurrent Programs
Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases
On Sharing and Determinacy in Concurrent Systems
Slimming down Petri Boxes: Compact Petri Net Models of Control Flows
Loop Parallelization in the Polytope Model
Bisimulation for Models in Concurrency
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
Relating Syntactic and Semantic Perturbations of Hybrid Automata
A Logic-Functional Approach to the Execution of CCS Specifications Modulo Behavioural Equivalences
Emptiness Is Decidable for Asynchronous Cellular Machines
Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper)
How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract)
Coverability Synthesis in Parametric Petri Nets
A Classification of Weak Asynchronous Models of Distributed Computing
Model Checking as Program Verification by Abstract Interpretation
On the Complexity of Verifying Concurrent Transition Systems
Type Systems for Concurrent Calculi (Abstract)
Abstraction for Stochastic Systems by Erlang's Method of Stages
Encoding CDuce in the Cpi-Calculus
CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings
Techniques for Smaller Intermediary BDDs
Linear-Time Model Checking Branching Processes
Timed Concurrent Game Structures
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard
Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk)
A Sound Foundation for the Topological Approach to Task Solvability
Selecting Theories and Recursive Protocols
Local Model Checking Games for Fixed Point Logic with Chop
The Observation Algebra of Spatial Pomsets
Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations
Minimization, Learning, and Conformance Testing of Boolean Programs
High-Level Message Sequence Charts and Projections
Minimization of Timed Transition Systems
Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report
Explainability is a Game for Probabilistic Bisimilarity Distances
Optimal Synchronization of ABD Networks
Linguistic Support of Receptionists for Shared Resources
Good for Games Automata: From Nondeterminism to Alternation
A Kleene Theorem for Higher-Dimensional Automata
Model Checking and Modular Verification
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages
Of Cores: A Partial-Exploration Framework for Markov Decision Processes
SOS for Higher Order Processes
Orchestrating Transactions in Join Calculus
Network Invariants in Action
Conditional Expectation and the Approximation of Labelled Markov Processes
Modelling Knowledge and Action in Distributed Systems
The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives
On the Axiomatisation of Branching Bisimulation Congruence over CCS
Verifying Temporal Properties of Processes
CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings
A Categorical Semantics of Signal Flow Graphs
Flatness and Complexity of Immediate Observation Petri Nets
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
Probabilistic Information Flow in a Process Algebra
Verifying Quantitative Temporal Properties of Procedural Programs
Verification Is Experimentation!
Concurrency: Theory, Language, And Architecture, UK/Japan Workshop, Oxford, UK, September 25-27, 1989, Proceedings
From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators
On Transformations of Concurrent Object Programs
Propositional Dynamic Logic for Hyperproperties
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency
Validity of Contextual Formulas
SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators
Lazy Probabilistic Model Checking without Determinisation
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free
Model Checking for Context-Free Processes
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Session Types as Intuitionistic Linear Propositions
Extended Temporal Logic Revisited
Process Algebra and Security
Algebraic Formulations of Trace Theory
The Individual and Collective Token Interpretations of Petri Nets
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
The Tau-Laws of Fusion
Constraint Solving for Contract-Signing Protocols
A Theory of Process with Localities (Extended Abstract)
Types for Cryptographic Protocols
The Static Derivation of Concurrency and its Mechanzed Certification
Theory by Process
Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games
Modelling and Verification of Distributed Algorithms
Decidability and Synthesis of Abstract Inductive Invariants
Algebraic Invariants for Linear Hybrid Automata
Generic Forward and Backward Simulations
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
On an Invariance Problem for Parameterized Concurrent Systems
Parameterized Systems in BIP: Design and Model Checking
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
Parameterized Complexity Results for 1-safe Petri Nets
Deriving Weak Bisimulation Congruences from Reduction Systems
Process Algebra with a Zero Object
Unavoidable Configurations of Parameterized Rings of Processes
Testing Concurrent Systems: A Formal Approach
Involved VASS Zoo (Invited Talk)
The Siren Song of Temporal Synthesis (Invited Talk)
Operational and Compositional Semantics of Synchronous Automaton Compositions
Netcharts: Bridging the gap between HMSCs and executable specifications
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
A Linear Account of Session Types in the Pi Calculus
Determinacy in Discrete-Bidding Infinite-Duration Games
Domains of Higher-Dimensional Automata
A Framework for the Analysis of Security Protocols
36th International Conference on Concurrency Theory, CONCUR 2025, Aarhus, Denmark, August 26-29, 2025
Extended Horn Clauses: The Framework and Some Semantics
Branching Time Temporal Logic and Amorphous Tree Automata
Transactions in RCCS
Robust Synchronization in Markov Decision Processes
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
The Power of Well-Structured Systems
Assume-Admissible Synthesis
Categories of Models for Concurrency
Verification for Timed Automata Extended with Unbounded Discrete Data Structures
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Timed Automata and the Theory of Real Numbers
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Turing Meets Milner
CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings
Optimal Assumptions for Synthesis
On the Complexity of Branching Modular Model Checking (Extended Abstract)
A Conditional Operator for CCS
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software
Process Semantics of Graph Reduction
CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings
Global Caching for the Alternation-free μ-Calculus
A Hierarchical Approach to Hardware Design
Infinite-Duration Bidding Games
A Theory of Testing for ACP
Value-Passing in Process Algebras (Abstract)
Real Equation Systems with Alternating Fixed-Points
Algebraic Laws for Weak Consistency
Termination Analysis of Integer Linear Loops
Averaging in LTL
Laws of Programming: The Algebraic Unification of Theories of Concurrency
Praobabilistic Resource Failure in Real-Time Process Algebra
Model Checking Omega-regular Properties for Quantum Markov Chains
Parallel and Distributed Model Checking, PDMC 2002, Satellite Workshop of CONCUR 2002, Brno, Czech Republic, August 19, 2002
Priority Downward Closures
Possible Worlds for Process Algebras
An Algebraic Theory of Multiple Clocks
Executing Temporal Logic: Review and Prospects (Abstract)
Stability in Graphs and Games
Process Algebra with Partial Choice
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking
Hierarchical Models of Synchronous Circuits (Abstract)
Adding Negative Prices to Priced Timed Games
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable
Monus Semantics in Vector Addition Systems with States
Partial Order Reduction for Security Protocols
34th International Conference on Concurrency Theory, CONCUR 2023, Antwerp, Belgium, September 18-23, 2023
Typed Mobile Objects
Optimal Concolic Dynamic Partial Order Reduction
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints
Residual Nominal Automata
On Ranking Function Synthesis and Termination for Polynomial Programs
Proof-Checking Protocols Using Bisimulations
Efficient Coverability Analysis by Proof Minimization
A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
Weighted Bisimulation in Linear Algebraic Form
A Hierarchy of Expressiveness in Concurrent Interaction Nets
A Connector Algebra for P/T Nets Interactions
Divide and Compose: SCC Refinement for Language Emptiness
Coalgebraic Theory of Büchi and Parity Automata: Fixed-Point Specifications, Categorically (Invited Tutorial)
Well-Structured Pushdown Systems
The ESTEREL Synchronous Programming Language and its Mathematical Semantics
Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
Modelling IP Mobility
Verification of Qualitative Constraints
Bisimulation and Propositional Intuitionistic Logic
Conditional Automata: A Tool for Safe Removal of Negligible Events
Transition System Specifications with Negative Premises (Extended Abstract)
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
A Theory of System Behaviour in the Presence of Node and Link Failures
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous
Modal Logic over Higher Dimensional Automata
Lax Bialgebras and Up-To Techniques for Weak Bisimulations
On Decidability of Concurrent Kleene Algebra
Causally Consistent Dynamic Slicing
Action Contraction
On Frequency LTL in Probabilistic Systems
State Equivalences for Rectangular Hybrid Automata
Event-State Duality: The Enriched Case
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
Delay-Insensitive Circuits: An Algebraic Approach to their Design
Linear Constraint Systems as High-Level Nets
Deterministic Negotiations: Concurrency for Free
Minimality and Separation Results on Asynchronous Mobile Processes: Representability Theorems by Concurrent Combinators (Extended Abstract)
Partial Order Reduction for Model Checking of Timed Automata
A Graphical Representation of Interval Logic
On the Representation of References in the Pi-Calculus
Retracing Some Paths in Process Algebra
Automating Memory Model Metatheory with Intersections
A Top-down Step-wise Refinement Methodology for Protocol Specification
Advanced Ramsey-Based Büchi Automata Inclusion Testing
Fairness and Consensus in an Asynchronous Opinion Model for Social Networks
Exact Fluid Lumpability for Markovian Process Algebra
On Implementations and Semantics of a Concurrent Programming Language
Categorical Methods for Concurrency, Interaction, and Mobility 2002, CONCUR 2002 Satellite Workshop, Brno, Czech Republic, August 24, 2002
Time for Timed Monitorability
Semantics of Deterministic Shared-Memory Systems
CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings
Phase-Bounded Broadcast Networks over Topologies of Communication
Volume and Entropy of Regular Timed Languages: Discretization Approach
A Spatial Logic for Concurrency (Part II)
Adding Partial Orders to Linear Temporal Logic
Mobility Control Via Passports
Partial Order Reduction for Reachability Games
Refinement for Signal Flow Graphs
Bisimulation Collapse and the Process Taxonomy
CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings
Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency
Solving Parity Games on Integer Vectors
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
A State Transformation Equivalence for Concurrent Systems: Exhibited Functionality-equivalence
Forward Progress on GPU Concurrency (Invited Talk)
The Impact of Hardware Models on Shared Memory Consistency Conditions
Defining Fairness
The Fusion Machine
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
An Implicitly-Typed Deadlock-Free Process Calculus
The Complexity of Nash Equilibria in Limit-Average Games
Testing, Betting and Timed True Concurrency
Combinations of Qualitative Winning for Stochastic Parity Games
Exception Handling and Real Time Features in an Object-Oriented Concurrent Language
Concurrency and Composition in a Stochastic World
The Complexity of Flat Freeze LTL
Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs
Model Checking PA-Processes
Bounded Reachability Problems Are Decidable in FIFO Machines
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
Tractable Reasoning in a Fragment of Separation Logic
Obliging Games
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992, Proceedings
Quantitative Languages Defined by Functional Automata
Temporal Antecedent Failure: Refining Vacuity
Granularity and Concurrent Separation Logic
While Waiting for the Millennium: Formal Specification and Verficiation of Concurrent Systems Now (Abstract)
Games Other People Play
Enabling Preserving Bisimulation Equivalence
Minimising the Probabilistic Bisimilarity Distance
On the Expressiveness of Internal Mobility in Name-Passing Calculi
On the Succinctness of Idioms for Concurrent Programming
Graph Rewriting as a Computational Model
Forward and Backward Bisimulations for Chemical Reaction Networks
Games with Trading of Control
Quantitative Relations and Approximate Process Equivalences
Coalgebraic Trace Semantics for Buechi and Parity Automata
A Testing Theory for Generally Distributed Stochastic Processes
Expressive Equivalence Between Decidable Freeze and Metric Timed Temporal Logics
Asynchronous Games: Innocence Without Alternation
The Modal mu-calculus Alternation Hierarchy is Strict
Constraints as Processes
Formal Models for Communication-Based Design
Typing Non-uniform Concurrent Objects
Reachability in Parameterized Systems: All Flavors of Threshold Automata
Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper)
Type Based Discretionary Access Control
Checking Verifications of Protocols and Distributed Systems by Computer
Verification of Immediate Observation Population Protocols
The Computational Field Model for Open Distributed Environments
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
The Control of Synchronous Systems, Part II
Combining Theorem Proving and Model Checking through Symbolic Analysis
A Geometric Approach to the Problem of Unique Decomposition of Processes
Model Checking Timed Automata with One or Two Clocks
Modal Logics for Nominal Transition Systems
Environment Assumptions for Synthesis
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions
Trees from Functions as Processes
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm
Model Checking for pi -Calculus Using Proof Search
Synthesizing Distributed Finite-State Systems from MSCs
Compositional Modeling of Reactive Systems Using Open Nets
Compositional Model Checking of Real Time Systems
How to Parallelize Sequential Processes
Proving Termination of Communicating Programs
Playing Stochastic Games Precisely
Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
Concurrent Graph and Term Graph Rewriting
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Model-Based Verification Methods and Tools (Abstract)
Locally Computable Coding for Unary Operations
A Polymorphic Type System for the Polyadic pi-calculus
Cost Preserving Bisimulations for Probabilistic Automata
Proceedings of the First Workshop on Concurrent Models in Molecular Biology, BioConcur@CONCUR 2003, Marseille, France, September 6, 2003
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes
Reordering Derivatives of Trace Closures of Regular Languages
Distributed Asynchronous Automata
R-Automata
Arena-Independent Finite-Memory Determinacy in Stochastic Games
Semantic Considerations in the Actor Paradigm of Concurrent Computation
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games
Rectangular Hybrid Games
Private Names in Non-Commutative Logic
Trust in Anonymity Networks
Uniform Sampling for Networks of Automata
Distributed Local Strategies in Broadcast Networks
Algebraic Structure of Combined Traces
A Dynamic Approach to Timed Behaviour
Non-deterministic Weighted Automata on Random Words
Validating Firewalls in Mobile Ambients
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis
A Synchronous Calculus of Relative Frequency
Knowledge and Information in Probabilistic Systems
Automata and Coinduction (An Exercise in Coalgebra)
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
Compositional Control Synthesis for Partially Observable Systems
Rewriting as a Unified Model of Concurrency
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
Using Ambients to Control Resources
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
Inaproximability in Weighted Timed Games
A Petri Net Semantics for pi-Calculus
Howe's Method for Contextual Semantics
Love Thy Neighbor: V-Formation as a Problem of Model Predictive Control
A Compositional Semantics for Statecharts using Labeled Transition Systems
Local Linearizability for Concurrent Container-Type Data Structures
Channel Representations in Protocol Verification
New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes
Concurrent Clustered Programming
Towards a Design Calculus for Communicationg Programs
Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement
Algebraic Interpretation of Lambda Calculus with Resources
A Logic for True Concurrency
Subtyping Context-Free Session Types
Characterizing Progress Properties of Concurrent Objects via Contextual Refinements
An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques
Session Types for Access and Information Flow Control
Model-Checking Games for Fixpoint Logics with Partial Order Models
Coverability in 1-VASS with Disequality Tests
Decomposing Permutation Automata
Generating Type Systems for Process Graphs
Stackelberg-Pareto Synthesis
Is Observational Congruence Axiomatisable in Equational Horn Logic?
Taming Concurrency: A Program Verification Perspective
On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
Dynamic Data-Race Detection Through the Fine-Grained Lens
Checking Coverage for Infinite Collections of Timed Scenarios
Universality Problem for Unambiguous VASS
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk)
An Extension of Pushdown System and Its Model Checking Method
A Presheaf Semantics of Value-Passing Processes
Models for Concurrent Constraint Programming
Compositional Verification and Optimization of Interactive Markov Chains
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Tutorial: Proving Properties of Concurrent System with SPIN
Semancitcs of Real-time Distributed Programs
Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, GT-VC@CONCUR 2006, Bonn, Germany, August 31, 2006
Testing Equivalence for Mobile Processes (Extended Abstract)
Bisimulations Up-to for the Linear Time Branching Time Spectrum
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
Quantified CTL: Expressiveness and Model Checking - (Extended Abstract)
A Complete Theory of Deterministic Event Structures
Admissibility in Games with Imperfect Information (Invited Talk)
Probability and Nondeterminism in Operational Models of Concurrency
The Power of Convex Algebras
Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems
Bisimulations for a Calculus of Broadcasting Systems
Energy Mean-Payoff Games
On Probabilistic Program Equivalence and Refinement
31st International Conference on Concurrency Theory, CONCUR 2020, Vienna, Austria (Virtual Conference), September 1-4, 2020
Controlled Timed Automata
Some Remarks on Definability of Process Graphs
Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures
Reasoning about Asynchronous Communication in Dynamically Evolving Object Structures
Expand, Enlarge, and Check for Branching Vector Addition Systems
On the Semantics of Petri Nets
MSO Decidability of Multi-Pushdown Systems via Split-Width
Model-Free Reinforcement Learning for Stochastic Parity Games
The Saga of the Axiomatization of Parallel Composition
Unfolding and Finite Prefix for Nets with Read Arcs
Completeness Theorems for Kleene Algebra with Top
27th International Conference on Concurrency Theory, CONCUR 2016, Québec City, Canada, August 23-26, 2016
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
Comparative Branching-Time Semantics