yusuke1997/dblp-id-title huggingface dataset:
Regular Games with Imperfect Information Are Not That Regular
Unfolding-Based Diagnosis of Systems with an Evolving Topology
A Hierarchy of Polynomial-Time Computable Simulations for Automata
Applications of Topology to Semantics of Communicating Processes
Timed Automata Can Always Be Made Implementable
Invariants in Process Algebra with Data
Constrained Properties, Semilinear Systems, and Petri Nets
Premature Return - Another Interpretation of the Future Construct
Using the Temporal Logic RDL for Design Specifications
Algebra for Infinite Forests with an Application to the Temporal Logic EF
Synthesis of Computable Regular Functions of Infinite Words
Object Types against Races
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models
Decidable Topologies for Communicating Automata with FIFO and Bag Channels
Mixing Lossy and Perfect Fifo Channels
Homology of Higher Dimensional Automata
Parameterized complexity of games with monotonically ordered omega-regular objectives
From Rewrite to Bisimulation Congruences
Event Structures for Mixed Choice
A Faster Algorithm for Solving One-Clock Priced Timed Games
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
29th International Conference on Concurrency Theory, CONCUR 2018, Beijing, China, September 4-7, 2018
Satisfiability of CTL* with Constraints
A Theory of History Dependent Abstractions for Learning Interface Automata
µABC: A Minimal Aspect Calculus
Stochastic Transition Systems
Deriving Bisimulation Congruences for Reactive Systems
Temporal Explorability Games
Normed BPA vs. Normed BPP Revisited
A Sound and Complete Characterization of Fair Asynchronous Session Subtyping
Completeness in Real Time Process Algebra
Open Maps, Alternating Simulations and Control Synthesis
On the Reachability Problem in Cryptographic Protocols
Refinement in Interworkings
A Framework for Transactional Consistency Models with Atomic Visibility
On Unifying Assumption-Commitment Style Proof Rules for Concurrency
Computing Probabilistic Bisimilarity Distances via Policy Iteration
Unfolding-based Partial Order Reduction
Interpreting a Finitary Pi-calculus in Differential Interaction Nets
A Practical Technique for Process Abstraction
Efficient Verification of Determinate Processes
A Game of Pawns
Lokal Model Checking Games
Time-Bounded Verification
Compression of Partially Ordered Strings
Global Progress in Dynamically Interleaved Multiparty Sessions
Generalized Bisimulation Metrics
Types, or: Where's the Difference Between CCS and pi?
Left-Linear Rewriting in Adhesive Categories
Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions
Multiport Interaction Nets and Concurrency
Model Checking Quantum Continuous-Time Markov Chains
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives
Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics
Operational Determinism and Fast Algorithms
Computing Stuttering Simulations
Relating Fairness and Timing in Process Algebras
Propositional Temporal Logics and Equivalences
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
A Unifying Approach to Data-Independence
Distributed Timed Automata with Independently Evolving Clocks
A Compositional Semantic Theory for Synchronous Component-based Design
Automated Detection of Serializability Violations Under Weak Consistency
Encoding Asynchronous Interactions Using Open Petri Nets
Detecting Deadlocks in Concurrent Systems
Controller Synthesis for MTL Specifications
Specifying Stateful Asynchronous Properties for Distributed Programs
A Theory of Bisimulation for the pi-Calculus
Weighted Transducers for Robustness Verification
Logic of Trace Languages (Extended Abstract)
Reachability Analysis of Pushdown Automata: Application to Model-Checking
Using Higher-Order Contracts to Model Session Types (Extended Abstract)
A Semantic Deconstruction of Session Types
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Delayed choice for process algebra with abstraction
CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Acceptance Trees for Probabilistic Processes
The Observational Power of Clocks
Complexity of Coverability in Depth-Bounded Processes
A Decidable Non-Regular Modal Fixpoint Logic
Efficient Multiple-Valued Model-Checking Using Lattice Representations
Reachability for Bounded Branching VASS
CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings
Open Bisimilarity for the π-Calculus with Mismatch
A Rule Format for Associativity
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents
Efficient CTL Model-Checking for Pushdown Systems
Comparing Two Approaches to Compensable Flow Composition
Maximally Concurrent Evolution of Non-sequential Systems
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
Minimal Memory Schedules for Dataflow Networks
Robustly Parameterised Higher-Order Probabilistic Models
On Coherence Properties in Team Rewriting Models of Concurrency
Modular Construction of Modal Logics
On the Axiomatic Treatment of Concurrency
On Petri Nets with Hierarchical Special Arcs
Second-Order Simple Grammars
Linear Distances between Markov Chains
Causality-Based Verification of Multi-threaded Programs
Nash Equilibria for Reachability Objectives in Multi-player Timed Games
An Algebraic Characterization of Data and Timed Languages
Verification of Population Protocols
Herbrand Automata for Hardware Verification
Causality vs. Interleavings in Concurrent Game Semantics
Bisimulation Equivalence is Decidable for Basic Parallel Processes
First-Order Axioms for Asynchrony
Probabilistic I/O Automata: Theories of Two Equivalences
A Product Version of Dynamic Linear Time Temporal Logic
On-The-Fly Verification: Advancements in Dependency Graphs (Invited Talk)
Towards Concurrent Quantitative Separation Logic
Borel Determinacy of Concurrent Games
Perspectives on Transactional Memory
Compositional Event Structure Semantics for the Internal pi -Calculus
Total Algorithms
A General Approach to Under-Approximate Reasoning About Concurrent Programs
Embeddings Among Concurrent Programming Languages (Preliminary Version)
Comparing Transition Systems with Independence and Asynchronous Transition Systems
Temporal Logic and Causality in Concurrent Systems
Compositional Active Learning of Synchronizing Systems Through Automated Alphabet Refinement
Reversing Higher-Order Pi
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
Two-Player Boundedness Counter Games
Quantitative Verification and Control via the Mu-Calculus
Generalising Projection in Asynchronous Multiparty Session Types
The Effect of Tossing Coins in Omega-Automata
Tight Game Abstractions of Probabilistic Automata
The Linear Time - Branching Time Spectrum II
Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ..
Efficient Bisimilarities from Second-Order Reaction Semantics for pi -Calculus
Action and State-based Logics for Process Algebras
Efficient Automation of Temporal Reasoning
Typed ψ-calculi
The Element of Surprise in Timed Games
Stochastic Real-Time Games with Qualitative Timed Automata Objectives
Separating Sessions Smoothly
A New Strategy for Proving omega-Completeness applied to Process Algebra
GPU Schedulers: How Fair Is Fair Enough?
The Impressive Power of Stopwatches
Verification of a Distributed Summation Algorithm
Symbolic Bisimulation in the Spi Calculus
Abstract Games for Infinite State Processes
Geometric Logic, Causality and Event Structures
An Unfolding Algorithm for Synchronous Products of Transition Systems
30th International Conference on Concurrency Theory, CONCUR 2019, Amsterdam, The Netherlands, August 27-30, 2019
Impact of Resource Sharing on Performance and Performance Prediction: A Survey
A Demonic Approach to Information in Probabilistic Systems
Action Transducers and Timed Automata
Real Space Process Algebra
Linearizability with Ownership Transfer
Equilibrium Design for Concurrent Games
Why Is Simulation Harder than Bisimulation?
CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings
Reversible Pebble Transducers
Synthesis of Nets with Inhibitor Arcs
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
Asymmetric Distances for Approximate Differential Privacy
Model Checking Restricted Sets of Timed Paths
An Automata-Based Approach for Synchronizable Mailbox Communication
Synchrony Loosening Transformations for Interacting Processes
Chi Calculus with Mismatch
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments
Proof-Outlines for Threads in Java
A Language for Task Orchestration and Its Semantic Properties
The Problem of "Weak Bisimulation up to"
Compositional Methods for Probabilistic Systems
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
Deciding Bisimilarity between BPA and BPP Processes
On the Expressiveness of QCTL
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
Alternating Weak Automata from Universal Trees
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains
Logic of Global Synchrony
Real-Time Behaviour of Asynchronous Agents
Game-Based Local Model Checking for the Coalgebraic mu-Calculus
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs
New Fault Domains for Conformance Testing of Finite State Machines
A Static Analysis Technique for Graph Transformation Systems
Topological Self-Stabilization with Name-Passing Process Calculi
Carrying Probabilities to the Infinite World
Alternating Refinement Relations
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ..
A Spectrum of Approximate Probabilistic Bisimulations
Effect Semantics for Quantum Process Calculi
Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification, GT-VC@CONCUR 2007, Lisbon, Portugal, September 3, 2007
Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper)
A Semantics for Concurrent Separation Logic
A Notion of Glue Expressiveness for Component-Based Systems
Linear Forwarders
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
Towards an Efficient Algorithm for Unfolding Petri Nets
Learning I/O Automata
On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences
Reachability and Termination Analysis of Concurrent Quantum Programs
Abstraction-Based Model Checking Using Modal Transition Systems
Open Bisimulations on Chi Processes
Synthesis from Component Libraries with Costs
On Interleaving in Timed Automata
Partial-Order Methods for Temporal Verification
Algebra and Coalgebra of Stream Products
A Compositional Model for Layered Distributed Systems
Bundle Event Structures and CCSP
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings
Deriving Syntax and Axioms for Quantitative Regular Behaviours
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Causality Based Models for the Design of Concurrent Systems
CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings
Strategy Construction for Parity Games with Imperfect Information
A Theory of Name Boundedness
Local Model Checking for Parallel Compositions of Context-Free Processes
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
Probabilistic Concurrent Constraint Programming
On Barbed Equivalences in pi-Calculus
Flow Logic
Verifying Concurrent Search Structures (Invited Talk)
Deciding Polynomial Termination Complexity for VASS Programs
Modularity for Timed and Hybrid Systems
Formal Methods Technology Transfer: Impediments and Innovation (Abstract)
Axiomatising Linear Time Mu-calculus
Verification by Network Decomposition
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic
Strategy Synthesis for Multi-Dimensional Quantitative Objectives
Unbounded Product-Form Petri Nets
Probabilistic Operational Correspondence
Non-Deterministic Abstract Machines
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
Fibrational Control Structures
An Automata-Theoretic Approach to Protocol Verification (Abstract)
Reachability Probabilities of Quantum Markov Chains
Translating Asynchronous Games for Distributed Synthesis
A Partial Order Event Model for Concurrent Objects
Automatic Analysis of Expected Termination Time for Population Protocols
Meeting Deadlines Together
The Big-O Problem for Labelled Markov Chains and Weighted Automata
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations
Exploiting Hierarchical Structure for Efficient Formal Verification
Bi-Reachability in Petri Nets with Data
On Causal Semantics of Petri Nets
Effective Divergence Analysis for Linear Recurrence Sequences
Infinite Results
Static Livelock Analysis in CSP
Passive Learning of Regular Data Languages in Polynomial Time and Data
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
The Polyadic Pi-calculus (Abstract)
Causality Semantics of Petri Nets with Weighted Inhibitor Arcs
CONCUR '98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings
Networks of Real-Time Processes
Model Checking Quantified Computation Tree Logic
A Calculus for Concurrent Objects
Some Results on the pi-Calculus
Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
The Silent Step in Time
Regularity of BPA-Systems is Decidable
A Communication Based Model for Games of Imperfect Information
Generic Forward and Backward Simulations II: Probabilistic Simulation
Implicit Typing à la ML for the Join-Calculus
Factorization of Finite State Machines under Observational Equivalence
An Implementation Model of Rendezvous Communication
History-Deterministic Vector Addition Systems
Abstract Timed Observation and Process Algebra
Rule Formats for Nominal Process Calculi
Secure Enforcement for Global Process Specifications
A General Proof System for Modalities in Concurrent Constraint Programming
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix
Games I/O Automata Play (Extended Abstract)
Reachability in Fixed Dimension Vector Addition Systems with States
Proceedings of the Workshop on Graph Transformation for Verification and Concurrency, GT-VC 2005, Satellite Event of CONCUR 2005, San Francisco, CA, USA, August 22, 2005
About Decisiveness of Dynamic Probabilistic Models
Compositional Performance Analysis Using Probabilistic I/O Automata
Model Construction for Implicit Specifications in Model Logic
Bisimulations for Probabilistic and Quantum Processes (Invited Paper)
On the Compositionality of Round Abstraction
A Survey of Regular Model Checking
Veryfying Parameterized Networks using Abstraction and Regular Languages
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract)
Data Base Distribution and Concurrency for End-Users (Abstract)
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
Testing-Based Abstractions for Value-Passing Systems
A Multiset Semantics for the pi-Calculus with Replication
Termination in Impure Concurrent Languages
CONCUR Test-Of-Time Award 2021 (Invited Paper)
Analysis of ESTELLE Specifications
An Introduction to Modal and Temporal Logics for CCS
Non Interleaving Process Algebra
Inference of Event-Recording Automata Using Timed Decision Trees
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL
(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
Concurrent Behaviour: Sequences, Processes and Axioms
Countable Non-Determinism and Uncountable Limits
Transience in Countable MDPs
Extended Markovian Process Algebra
Typing Mobility in the Seal Calculus
Reaching Your Goal Optimally by Playing at Random with No Memory
The Fixpoint-Analysis Machine
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Liveness, Fairness and Impossible Futures
Verification of Nonregular Temporal Properties for Context-Free Processes
A Survey of Bidding Games on Graphs (Invited Paper)
The Linear Time-Branching Time Spectrum (Extended Abstract)
Inclusion Testing of Büchi Automata Based on Well-Quasiorders
Event Structure Semantics for Nominal Calculi
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces
Synchronized Hyperedge Replacement with Name Mobility
Requirement and Design Specification for Distributed Systems
An Axiomatization of Lamport's Temporal Logic of Actions
Symbolic Computation of Maximal Probabilistic Reachability
Towards Performance Evaluation with General Distributions in Process Algebras
Convergence of Iteration Systems (Extended Abstract)
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation
Techniques for Decidability and Undecidability of Bisimilarity
Asynchronous Games 2: The True Concurrency of Innocence
Axiomatizing Flat Iteration
The Failure of Failures in a Paradigm for Asynchronous Communication
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets
Adaptive Synchronisation of Pushdown Automata
Quasi-Static Scheduling of Communicating Tasks
The Must Preorder Revisited
Zing: Exploiting Program Structure for Model Checking Concurrent Software
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
Fair Cooperative Multithreading
Extended Process Rewrite Systems: Expressiveness and Reachability
CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings
Bounded Stacks, Bags and Queues
Reversible Communicating Systems
A Framework for the Synthesis of Reactive Modules
Strategy Logic
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
A Fully Abstract Model of Fair Asynchrony
Type-Directed Concurrency
Duality and i/o-Types in the π-Calculus
Safety and Liveness of Quantitative Automata
Bounds on Mobility
Probabilistic Bisimulation: Naturally on Distributions
A Nice Labelling for Tree-Like Event Structures of Degree 3
On the Send-Synchronizability Problem for Mailbox Communication
The Benefits of Duality in Verifying Concurrent Programs under TSO
Decentralized Asynchronous Crash-Resilient Runtime Verification
Concurrent Testing of Processes (Extended Abstract)
Strategic Dominance: A New Preorder for Nondeterministic Processes
Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes
Axiomatisations of Weak Equivalences for De Simone Languages
Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
Bisimulations and Unfolding in P-Accessible Categorical Models
Principles of Persistent Programming (Invited Talk)
A Method for the Development of Totally Correct Shared-State Parallel Programs
Languages of Boundedly-Ambiguous Vector Addition Systems with States
Cyclic Vector Languages
Rule-Based Modelling of Cellular Signalling
Bisimilarity of One-Counter Processes Is PSPACE-Complete
Resolving Nondeterminism by Chance
Process Algebra with Asynchronous Communication Mechanisms
Reactive Systems over Directed Bigraphs
Causal Nets: A Modeling Language Tailored towards Process Discovery
Efficient Contextual Unfolding
On the Complexity of Reachability in Parametric Markov Decision Processes
A Context-Free Process as a Pushdown Automaton
Testing Probabilistic Automata
Power of Randomization in Automata on Infinite Strings
Deriving Unbounded Petri Nets from Formal Languages
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
Information Flow in Interactive Systems
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Invariants for Parameterised Boolean Equation Systems
On Coinduction and Quantum Lambda Calculi
Sequential Decision Making With Information Asymmetry (Invited Talk)
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
A Programming Logic for Formal Concurent Systems
Howe's Method for Calculi with Passivation
Some Finite-Graph Models for Process Algebra
Secure Information Flow for Concurrent Processes
An Ultra-Multiprocessing Machine Architecture for Efficient Parallel Execution of Functional Languages
Thermodynamic Graph-Rewriting
A Unifying Categorical View of Nondeterministic Iteration and Tests
Partial-Order Reduction in the Weak Modal Mu-Calculus
Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984
Bigraphical Categories
CTR: A Calculus of Timed Refinement
Kleene Algebra with Observations
Spatial and Epistemic Modalities in Constraint-Based Process Calculi
Affine Extensions of Integer Vector Addition Systems with States
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Goal-Driven Unfolding of Petri Nets
A Calculus of Mobile Resources
CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings
Elementary Control Structures
Towards an Efficient Tree Automata Based Technique for Timed Systems
Generalized Model Checking: Reasoning about Partial State Spaces
A Semantics for Hybrid Iteration
Stochastic Process Algebras Benefits for Performance Evaluation and Challenges (Extended Abstract)
Buffered Communication Analysis in Distributed Multiparty Sessions
A Uniform Framework for Timed Automata
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
An Example of Communicating Production Systems
Deciding What Is Good-For-MDPs
Liveness and Fairness in Process-Algebraic Verification
Checking Bisimilarity for Finitary pi-Calculus
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
A Higher Order Modal Fixed Point Logic
Characterizing EF and EX Tree Logics
Synthesis of Data Word Transducers
From Synchrony to Asynchrony
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
Concurrent Games on VASS with Inhibition
A General Approach to Derive Uncontrolled Reversible Semantics
Robustness Against Transactional Causal Consistency
Model Checking of Message Sequence Charts
Probabilistic Weighted Automata
Causal Message Sequence Charts
Weak Sequential Composition in Process Algebras
A Parallel Object Oriented Language FLENG++ and Its Control System on the Parallel Machine PIE64
Pushdown Module Checking with Imperfect Information
The Duality of TIme and Information
Universal Quantification Makes Automatic Structures Hard to Decide
Resources, Concurrency and Local Reasoning
Partially Observable Concurrent Kleene Algebra
Abstract Interpretation and Indeterminacy
Deriving Structural Labelled Transitions for Mobile Ambients
Causal Models for Rational Algebraic Processes
Modular Semantics for Transition System Specifications with Negative Premises
Universal Safety for Timed Petri Nets is PSPACE-complete
Synchronous Development of Asynchonous Systems
Using CSP to Verify a Timed Protocol over a Fair Medium
On Privacy and Accuracy in Data Releases (Invited Paper)
Explaining Behavioural Inequivalence Generically in Quasilinear Time
Proof Systems for Message-Passing Process Algebras
Algebraic Techniques for Timed Systems
Two Lower Bounds for BPA
Petri Boxes and Finite Precedence
First-Order Store and Visibility in Name-Passing Calculi
Nominal Büchi Automata with Name Allocation
CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings
Quantitative Verification with Neural Networks
Consistently-Detecting Monitors
A Congruence Theorem for Structured Operational Semantics with Predicates