scientific article

Publication date: 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

bisimulation transition systems linear time branching time axiomatization trace semantics tree semantics

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Weak equivalence of higher-dimensional automata, Resource Bisimilarity in Petri Nets is Decidable, Non-strongly Stable Orders Also Define Interesting Simulation Relations, Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum, The Equational Theory of Weak Complete Simulation Semantics over BCCSP, Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP, Final Semantics for Decorated Traces, Bisimulation equivalence and regularity for real-time one-counter automata, A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum, A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems, Unnamed Item, When Are Prime Formulae Characteristic?, Determining asynchronous test equivalence for probabilistic processes, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, Unnamed Item, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Modelling mutual exclusion in a process algebra with time-outs, Reverse bisimilarity vs. forward bisimilarity, Branching vs. Linear Time: Semantical Perspective, Reactive bisimulation semantics for a process algebra with timeouts, Equivalence checking 40 years after: a review of bisimulation tools, Independence Abstractions and Models of Concurrency, Removing redundant refusals: minimal complete test suites for failure trace semantics, Unnamed Item, Unnamed Item, Logical Characterisations and Compositionality of Input-Output Conformance Simulation, A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A Rule Format for Associativity, Relational Concurrent Refinement: Automata, Of wlp and CSP, More Relational Concurrent Refinement: Traces and Partial Relations, Unnamed Item, Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration, Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences, A modular approach to defining and characterising notions of simulation, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, On the Unification of Process Semantics: Observational Semantics, Unnamed Item, Unnamed Item, A Logic for True Concurrency, Unnamed Item, Modelling Divergence in Relational Concurrent Refinement, Non-regular iterators in process algebra, Unnamed Item, New Bisimulation Semantics for Distributed Systems, On the Unification of Process Semantics: Equational Semantics, Folk Theorems on the Correspondence between State-Based and Event-Based Systems, Equations, Contractions, and Unique Solutions, A Spectrum of Behavioral Relations over LTSs on Probability Distributions, Axiomatizing Weak Ready Simulation Semantics over BCCSP, Axiomatising divergence, Understanding, Explaining, and Deriving Refinement, Coalgebraic Modal Logic Beyond Sets, Formal Sequentialization of Distributed Systems via Program Rewriting, Simulations Up-to and Canonical Preorders, Modelling and analysing neural networks using a hybrid process algebra, Process algebra with guards: Combining hoare logic with process algebra, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Bisimilar and logically equivalent programs in PDL, Continuity controlled hybrid automata, Compositionality of Hennessy-Milner logic by structural operational semantics, Branching time and orthogonal bisimulation equivalence, Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies, DP lower bounds for equivalence-checking and model-checking of one-counter automata, Comparative trace semantics of time Petri nets, Axiomatizing recursion-free, regular monitors, Ready to preorder: an algebraic and general proof, Algebraic simulations, Comparative branching-time semantics for Markov chains, Automated verification of automata communicating via FIFO and bag buffers, ST-structures, Decidability issues for extended ping-pong protocols, Two-thirds simulation indexes and modal logic characterization, Fair testing, Nested semantics over finite trees are equationally hard, Conjunction on processes: Full abstraction via ready-tree semantics, SOS formats and meta-theory: 20 years after, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Congruence from the operator's point of view. Syntactic requirements on modal characterizations, Translating between models of concurrency, On the probabilistic bisimulation spectrum with silent moves, A linear-time branching-time perspective on interface automata, Minimal consistent DFA from sample strings, Characteristic invariants in Hennessy-Milner logic, \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics, Expressiveness of probabilistic modal logics: a gradual approach, Compositional semantics and behavioural equivalences for reaction systems with restriction, Distinguishing and relating higher-order and first-order processes by expressiveness, Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\), When are prime formulae characteristic?, Theory of interaction, Logical characterisations, rule formats and compositionality for input-output conformance simulation, The complexity of bisimilarity-checking for one-counter processes., Product line process theory, Temporal-logic property preservation under Z refinement, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet, SOS rule formats for idempotent terms and idempotent unary operators, Bialgebras for structural operational semantics: an introduction, Computing branching distances with quantitative games, On behavioural pseudometrics and closure ordinals, Distributability of mobile ambients, On finite alphabets and infinite bases, Generalizing the Paige-Tarjan algorithm by abstract interpretation, The quantitative linear-time-branching-time spectrum, Axiomatizing weak simulation semantics over BCCSP, Model-checking process equivalences, An efficient simulation algorithm on Kripke structures, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, Towards general axiomatizations for bisimilarity and trace semantics, From generic partition refinement to weighted tree automata minimization, Logics of temporal-epistemic actions, Computable fixpoints in well-structured symbolic model checking, CSP is a retract of CCS, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Unifying behavioral equivalences of timed transition systems, Verifying polymer reaction networks using bisimulation, Hybrid process algebra, Contexts, refinement and determinism, A hierarchy of failures-based models: theory and application, Dynamic consistency in process algebra: from paradigm to ACP, On the axiomatizability of priority. II, Metrics for weighted transition systems: axiomatization and complexity, Ensuring liveness properties of distributed systems: open problems, Relating fair testing and accordance for service replaceability, A precongruence format for should testing preorder, On the expressibility of priority, Ready to preorder: the case of weak process semantics, Measuring the confinement of probabilistic systems, Quantitative analysis of weighted transition systems, A parametric analysis of the state-explosion problem in model checking, Component simulation-based substitutivity managing QoS and composition issues, A brief history of process algebra, Process algebra for hybrid systems, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, Ready simulation for concurrency: it's logical!, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, An operational semantics for object-oriented concepts based on the class hierarchy, Introducing extra operations in refinement, Relational concurrent refinement. III: Traces, partial relations and automata, A linear-time-branching-time spectrum for behavioral specification theories, Revivals, stuckness and the hierarchy of CSP models, A game for linear-time-branching-time spectroscopy, (Bi)simulations up-to characterise process semantics, Bialgebraic methods and modal logic in structural operational semantics, Hardness of equivalence checking for composed finite-state systems, Relational concurrent refinement. II: Internal operations and outputs, Encoding safety in \(\mathrm{CLL}_R\), Dynamic epistemic logic with communication actions, Inductive synthesis of recursive processes from logical properties, Coalgebraic semantics for nominal automata, Employing behavioral preorders to define controllability for nondeterministic discrete-event systems, Compositional verification of asynchronous concurrent systems using CADP, Equivalence of recursive specifications in process algebra