English
Related papers

Related papers: Structural operational semantics for non-determini…

200 papers

We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear…

Logic in Computer Science · Computer Science 2017-02-09 Uli Fahrenberg , Jan Křetínský , Axel Legay , Louis-Marie Traonouez

Well-structured systems, aka WSTSs, are computational models where the set of possible configurations is equipped with a well-quasi-ordering which is compatible with the transition relation between configurations. This structure supports…

Logic in Computer Science · Computer Science 2014-02-13 Sylvain Schmitz , Philippe Schnoebelen

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for…

Logic in Computer Science · Computer Science 2023-06-22 Luca Aceto , Ignacio Fábregas , Álvaro García-Pérez , Anna Ingólfsdóttir , Yolanda Ortega-Mallén

There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path…

Formal Languages and Automata Theory · Computer Science 2019-02-18 Thorsten Wißmann , Jérémy Dubut , Shin-ya Katsumata , Ichiro Hasuo

Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies.…

Logic in Computer Science · Computer Science 2017-01-11 Johannes Borgström , Ramūnas Gutkovas , Joachim Parrow , Björn Victor , Johannes Åman Pohjola

Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which has…

Logic in Computer Science · Computer Science 2026-05-08 Sergey Goncharov , Stefan Milius , Lutz Schröder , Stelios Tsampas , Henning Urbat

Some formats of well-behaved operational specifications, correspond to natural transformations of certain types (for example, GSOS and coGSOS laws). These transformations have a common generalization: distributive laws of monads over…

Programming Languages · Computer Science 2014-08-08 Bartek Klin , Beata Nachyła

We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to…

Logic in Computer Science · Computer Science 2023-06-22 Valentina Castiglioni , Daniel Gebler , Simone Tini

Accurate modeling of spin-orbit coupling and noncollinear magnetism requires noncollinear density functionals within the two-component generalized Kohn-Sham (GKS) framework, yet constructing and implementing noncollinear functionals remains…

Materials Science · Physics 2025-11-26 Xiaoyu Zhang , Taoni Bao

In this paper we propose a generalized Gaussian process concurrent regression model for functional data where the functional response variable has a binomial, Poisson or other non-Gaussian distribution from an exponential family while the…

Methodology · Statistics 2014-02-03 Bo Wang , Jian Qing Shi

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic…

Logic in Computer Science · Computer Science 2024-02-05 David de Frutos-Escrig , Miguel Palomino , Ignacio Fábregas

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for…

Logic in Computer Science · Computer Science 2024-02-05 Luca Aceto , Ignacio Fábregas , Álvaro García-Pérez , Anna Ingólfsdóttir , Yolanda Ortega-Mallén

Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which…

Logic in Computer Science · Computer Science 2026-03-26 Sergey Goncharov , Stefan Milius , Lutz Schröder , Stelios Tsampas , Henning Urbat

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…

Logic in Computer Science · Computer Science 2023-01-25 Rob van Glabbeek

We discuss a general Bayesian framework on modeling multidimensional function-valued processes by using a Gaussian process or a heavy-tailed process as a prior, enabling us to handle nonseparable and/or nonstationary covariance structure.…

Methodology · Statistics 2020-07-29 Evandro Konzen , Jian Qing Shi , Zhanfeng Wang

In this paper, we propose several opacity-preserving (bi)simulation relations for general nondeterministic transition systems (NTS) in terms of initial-state opacity, current-state opacity, K-step opacity, and infinite-step opacity. We also…

Logic in Computer Science · Computer Science 2018-09-14 Kuize Zhang , Xiang Yin , Majid Zamani

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of…

Machine Learning · Computer Science 2014-08-12 Ricardo Silva , Robert B. Gramacy

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of…

Machine Learning · Computer Science 2010-03-15 Ricardo Silva , Robert B. Gramacy

We introduce categories of extended Gaussian maps and Gaussian relations which unify Gaussian probability distributions with relational nondeterminism in the form of linear relations. Both have crucial and well-understood applications in…

Logic in Computer Science · Computer Science 2023-06-08 Dario Stein , Richard Samuelson

Structural operational semantics (SOS) is a technique for defining operational semantics for programming and specification languages. Because of its intuitive appeal and flexibility, SOS has found considerable application in the study of…

Logic in Computer Science · Computer Science 2010-08-12 Luca Aceto , Paweł Sobociński