scientific article
From MaRDI portal
Publication:3907077
zbMath0457.68049MaRDI QIDQ3907077
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus, Model checking for action-based logics, Process algebra with guards: Combining hoare logic with process algebra, A semantic characterization for faults in replicated systems, A note on the complexity of deciding bisimilarity of normed unary processes, On sequential composition, action prefixes and process prefix, Concurrent histories: a basis for observing distributed systems, Bisimulations and abstraction homomorphisms, On the consistency of Koomen's fair abstraction rule, Bisimulation is two-way simulation, A complete equational axiomatization for prefix iteration, Fair Petri nets and structural induction for rings of processes, On reduction-based process semantics, A \(\pi\)-calculus with explicit substitutions, A polynomial algorithm for deciding bisimilarity of normed context-free processes, An algebraic characterization of observational equivalence, Fuzzy approximations of fuzzy relational structures, An introduction to the regular theory of fairness, A state-based approach to communicating processes, An equational axiomatization for multi-exit iteration, Bisimulation and effectiveness, A complete axiomatization of finite-state ACSR processes, Quiescence, fairness, testing, and the notion of implementation, Replication, refinement \& reachability: complexity in dynamic condition-response graphs, Concurrency and atomicity, Complexity of equivalence problems for concurrent systems of finite agents, Shuffle on trajectories: Syntactic constraints, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A fixpoint approach to finite delay and fairness, Design of decentralized critical observers for networks of finite state machines: a formal method approach, Probabilistic bisimilarity as testing equivalence, A process algebra of communicating shared resources with dense time and priorities, The equational logic of fixed points, Trees and semantics, Essential transitions to bisimulation equivalences, A general conservative extension theorem in process algebras with inequalities, Termination modulo equations by abstract commutation with an application to iteration, A semantic theory for value-passing processes based on the late approach, A gap property of deterministic tree languages., The complexity of bisimilarity-checking for one-counter processes., Undecidability of domino games and hhp-bisimilarity., Directed homology theories and Eilenberg-Steenrod axioms, Observational ultraproducts of polynomial coalgebras., Attributed transition systems with hidden transitions, Mathematical modal logic: A view of its evolution, Bisimulation through probabilistic testing, Factorisation of finite state machines under strong and observational equivalences, Domain theory for concurrency, Algebraic and fixed point equations over inverse limits of algebras, The equivalence in the DCP model, Co-induction in relational semantics, Partial specifications and compositional verification, Specification styles in distributed systems design and verification, An agent calculus with simple actions where the enabling and disabling are derived operators, Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule, Observational structures and their logic, A compositional protocol verification using relativized bisimulation, Proof systems for infinite behaviours, Maximality preserving bisimulation, Labeled fuzzy approximations based on bisimulations, Extensional quotient coalgebras, A short proof of the decidability of bisimulation for normed BPA- processes, Structured operational semantics and bisimulation as a congruence, Rule formats for distributivity, Unique decomposition of processes, CCS with Hennessy's merge has no finite-equational axiomatization, A brief history of process algebra, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, Observational congruences for dynamically reconfigurable tile systems, A logic for the stepwise development of reactive systems, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Approximate bisimulation relations for fuzzy automata, TIC: a tImed calculus, A complete axiomatisation for observational congruence of finite-state behaviours, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, Reaction graph, A complete equational axiomatization for MPA with string iteration, A process algebra with distributed priorities, An algebraic characterization of transition system equivalences, A behavioural theory of first-order CML, Theorem proving in a mathematical information environment, Towards a unified view of bisimulation: A comparative study, Fixpoint semantics and simulation, Linda-based applicative and imperative process algebras, Effective decomposability of sequential behaviours, Language preorder as a precongruence, Complete formal systems for equivalence problems, Universal coalgebra: A theory of systems, Relational transducers for electronic commerce, Deductive tools of an algebraic programming system, Toward an infinitary logic of domains: Abramsky logic for transition systems, Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups., Inductive synthesis of recursive processes from logical properties, Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\), Noninterference for concurrent programs and thread systems, The continuum as a final coalgebra, Coalgebra morphisms subsume open maps, Hiding resources that can fail: An axiomatic perspective, Additive models of probabilistic processes, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Coalgebras for Bisimulation of Weighted Automata over Semirings, Resource Bisimilarity in Petri Nets is Decidable, Termination, deadlock and divergence, A structural co-induction theorem, Three metric domains of processes for bisimulation, Verification and comparison of transition systems, Testability of a communicating system through an environment, On the Ehrenfeucht-Fraïssé game in theoretical computer science, A fully parallel calculus of synchronizing processes, Construction of a Deterministicω-Automaton Using Derivatives, Processes with multiple entries and exits, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Fairness, Resources, and Separation, Bisimulations Generated from Corecursive Equations, Final Semantics for Decorated Traces, Nominal SOS, Bisimulation as a logical relation, On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Unnamed Item, Graphes canoniques de graphes algébriques, Axiomatizations for the perpetual loop in process algebra, A notion of equivalence for stochastic Petri nets, A π-calculus with explicit substitutions: The late semantics, A completeness theorem for nondeterministic Kleene algebras, Read-write causality, Unnamed Item, Non-termination in Idempotent Semirings, On divergence-sensitive weak probabilistic bisimilarity, Bounded stacks, bags and queues, How to Parallelize sequential processes, Specification and verification of concurrent systems by causality and realizability, Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices, Bisimulations of Probabilistic Boolean Networks, Ugo Montanari and Software Verification, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Branching vs. Linear Time: Semantical Perspective, The Birth of Model Checking, Correcting a Space-Efficient Simulation Algorithm, Enhanced coalgebraic bisimulation, Unnamed Item, Unnamed Item, Unnamed Item, Equational properties of fixed-point operations in cartesian categories: An overview, Psi-calculi in Isabelle, Unnamed Item, Unnamed Item, Unnamed Item, Extended transition systems for parametric bisimulation, On deciding some equivalences for concurrent processes, Compositionality in state space verification methods, How to Reason Coinductively Informally, Fairness and regularity for SCCS processes, Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities, Causal Semantics for BPP Nets with Silent Moves, From Böhm's Theorem to Observational Equivalences, Complexity of Weak Bisimilarity and Regularity for BPA and BPP, Transfer Principles for Reasoning About Concurrent Programs, A Behavioural Pseudometric based on λ–Bisimilarity, Branching Bisimulation Congruence for Probabilistic Systems, EXPTIME-complete Decision Problems for Modal and Mixed Specifications, Variable binding operators in transition system specifications, A type reduction from proof-conditional to dynamic semantics, Bochvar-McCarthy logic and process algebra, A fully abstract denotational model for observational precongruence, Quantales, finite observations and strong bisimulation, Algebraic characterizations of trace and decorated trace equivalences over tree-like structures, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Pushdown automata, multiset automata, and Petri nets, Deciding bisimulation-like equivalences with finite-state processes, Unnamed Item, Unnamed Item, On Distributive Fixed-Point Expressions, A Finite Axiomatization of Nondeterministic Regular Expressions, Five Determinisation Algorithms, Unnamed Item, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Explicit substitutions for \(\pi\)-congruences, An axiomatic semantics for Esterel, Basic process algebra with deadlocking states, Recursive equations in higher-order process calculi, Model checking for a class of weighted automata, Model Checking for Action Abstraction, Asynchronous communication of Petri Nets and the refinement of transitions, Proved trees, Checking equivalences between concurrent systems of finite agents (Extended abstract), Complexity of Decision Problems for Mixed and Modal Specifications, Unnamed Item, Unnamed Item, Unnamed Item, Thread algebra for noninterference, Domain mu-calculus, Efficient Coalgebraic Partition Refinement, Simulation Relations and Controllability Properties of Linear and Nonlinear Control Systems, Reduction and Analysis of Boolean Control Networks by Bisimulation, Unnamed Item, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application, An Observational Theory for Mobile Ad Hoc Networks, The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems, Computable processes and bisimulation equivalence, Equality of agent expressions is preserved under an extension of the universe of actions, A symbolic decision procedure for symbolic alternating finite automata, Syntax and consistent equation semantics of hybrid Chi, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Branching time and orthogonal bisimulation equivalence, Bisimulation for Feller-Dynkin processes, An efficient algorithm for computing bisimulation equivalence, Towards a classification of behavioural equivalences in continuous-time Markov processes, Updatable timed automata, DP lower bounds for equivalence-checking and model-checking of one-counter automata, De Bakker-Zucker processes revisited, Explicit-State Model Checking, Abstraction and Abstraction Refinement, Model Checking Real-Time Systems, On Rule Formats for Zero and Unit Elements, Hennessy-Milner and van Benthem for instantial neighbourhood logic, Compositional verification of concurrent systems by combining bisimulations, Concurrent bisimulations in Petri nets, A domain equation for bisimulation, Comparative branching-time semantics for Markov chains, Axiomatizing rational power series over natural numbers, Undecidable equivalences for basic parallel processes, Model theory of XPath on data trees. II: Binary bisimulation and definability, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, Approximate predictability of pseudo-metric systems, Verification of finite-state machines: a distributed approach, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, On the probabilistic bisimulation spectrum with silent moves, A linear-time branching-time perspective on interface automata, Off-the-shelf automated analysis of liveness properties for just paths, Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus, Hennessy-Milner properties via topological compactness, When are prime formulae characteristic?, Depletable channels: dynamics, behaviour, and efficiency in network design, On the axiomatisability of priority. III: Priority strikes again, Temporal-logic property preservation under Z refinement, Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet, Cartesian difference categories, Sentences, Belief and Logical Omniscience, or What Does Deduction Tell Us?, SOS rule formats for idempotent terms and idempotent unary operators, Partition refinement of component interaction automata, Symbolic models for nonlinear time-delay systems using approximate bisimulations, Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus, Bisimulation for probabilistic transition systems: A coalgebraic approach, Team equivalences for finite-state machines with silent moves, Expressiveness of component-based frameworks: a study of the expressiveness of BIP, Axiomatizing weighted synchronization trees and weighted bisimilarity, Bisimulations for weighted automata over an additively idempotent semiring, Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics, An automatic method for the dynamic construction of abstractions of states of a formal model, Models of nondeterministic regular expressions, Axiomatizing weak simulation semantics over BCCSP, Rooted branching bisimulation as a congruence, Deciding bisimilarity and similarity for probabilistic processes., Team bisimilarity, and its associated modal logic, for BPP nets, Characteristic Formulae for Timed Automata, Limited approximate bisimulations and the corresponding rough approximations, Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic, Modular construction of complete coalgebraic logics, From generic partition refinement to weighted tree automata minimization, Denotational semantics for thread algebra, Universal extensions to simulate specifications, Set graphs. II. Complexity of set graph recognition and similar problems, Bisimulation relations for weighted automata, Notions of bisimulation and congruence formats for SOS with data, Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism, Trapezoid method for solving systems of linear inequalities and its implementation in insertion modeling, A modular approach to defining and characterising notions of simulation, Verification of concurrent programs: The automata-theoretic framework, Approximating and computing behavioural distances in probabilistic transition systems, From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives, A linear-time-branching-time spectrum for behavioral specification theories, Controller synthesis for bisimulation equivalence, Structural Operational Semantics with First-Order Logic, Automating Soundness Proofs, Bisimulation of type 2 for BL-general fuzzy automata, Counting nondeterministic computations, A study on team bisimulation and H-team bisimulation for BPP nets, A thesis for interaction, Deciding probabilistic bisimilarity distance one for probabilistic automata, Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems, Equational theories for automata, Deriving Bisimulation Congruences: A 2-categorical Approach, Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface, A tutorial on coinductive stream calculus and signal flow graphs, An infinite hierarchy of temporal logics over branching time, Remarks on Testing Probabilistic Processes, Relating Hybrid Chi to Other Formalisms, Program algebra with unit instruction operators, Iterating transducers, Completeness results for omega-regular algebras, Simulations Up-to and Canonical Preorders, Compositional verification of asynchronous concurrent systems using CADP, Specification and verification of concurrent programs through refinements, An Exercise on Transition Systems, Refinement in hybridised institutions, Next-preserving branching bisimulation, Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves, The max-plus algebra of the natural numbers has no finite equational basis, Characterization and computation of approximate bisimulations for fuzzy automata, Infinite objects in type theory, Reverse bisimilarity vs. forward bisimilarity, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Weighted and branching bisimilarities from generalized open maps, Fuzzy simulations and bisimulations between fuzzy automata, Infinite results, Simulation relations and applications in formal methods, Nonwellfounded sets and programming language semantics, On relating concurrency and nondeterminism, Lowerbounds for Bisimulation by Partition Refinement, A Theory of Formal Choreographic Languages, Behavioural equivalences for continuous-time Markov processes, Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems, Enhancing active model learning with equivalence checking using simulation relations, Analysing AWN-Specifications Using mCRL2 (Extended Abstract), Reaction Systems, Transition Systems, and Equivalences, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Equivalence checking 40 years after: a review of bisimulation tools, Bisimulation, games, and logic, A process algebra with distributed priorities, Learning Mealy machines with one timer, A connection between concurrency and language theory, History-preserving bisimilarity for higher-dimensional automata via open maps, Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions, Merging regular processes by means of fixed-point theory, The greatest fixed-points and rational omega-tree languages, Weak bisimulations for fuzzy automata, Model independent approach to probabilistic models, A context dependent equivalence between processes, Transition systems from event structures revisited, A non-SOS operational semantics for a process algebra, A syntactic commutativity format for SOS, Regularity of normed PA processes, Ready to preorder: an algebraic and general proof, Algebraic simulations, Bisimilarity is not finitely based over BPA with interrupt, Two-thirds simulation indexes and modal logic characterization, Fair testing, Symbolic models for control systems, Bisimulation on speed: Worst-case efficiency, Nested semantics over finite trees are equationally hard, SOS formats and meta-theory: 20 years after, Algebraic notions of nontermination: Omega and divergence in idempotent semirings, Information flow in systems with schedulers. II: Refinement, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, An observationally complete program logic for imperative higher-order functions, A game-theoretic approach to fault diagnosis and identification of hybrid systems, Translating FSP into LOTOS and networks of automata, Theory and computation of discrete state space decompositions for hybrid systems, General quantitative specification theories with modal transition systems, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Theory of interaction, Product line process theory, Proving language inclusion and equivalence by coinduction, Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Generalising Conduché's theorem, Process simulation and refinement, Coalgebras in functional programming and type theory, Proof systems for satisfiability in Hennessy-Milner logic with recursion, A partial ordering semantics for CCS, Bisimilarity enforcing supervisory control for deterministic specifications, A ground-complete axiomatization of stateless bisimilarity over Linda, A modal characterization of alternating approximate bisimilarity, Bounded semantics, Extensional Petri net, Literal shuffle on \(\omega\)-languages, Modelling causality via action dependencies in branching time semantics, Location equivalence in a parametric setting, An intuitionistic version of Ramsey's theorem and its use in program termination, Late and early semantics coincide for testing, On the implementation of concurrent calculi in net calculi: two case studies, A theory of processes with durational actions, Rough approximations based on bisimulations, Undecidability of performance equivalence of Petri nets, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Computing maximal weak and other bisimulations, Analysis of the structure of attributed transition systems without hidden transitions, Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous, Transition system specifications with negative premises, Bisimulation and action refinement, The expressive power of implicit specifications, Universal axioms for bisimulations, Deriving graphical representations of process networks from algebraic expressions, Refinement of actions in event structures and causal trees, On bisimulations for description logics, Automatic verification of distributed systems: the process algebra approach., On the expressiveness of interaction, Computation of the greatest simulations and bisimulations between fuzzy automata, Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi, On the observational theory of the CPS-calculus, Simulation refinement for concurrency verification, On the axiomatizability of priority. II, SOS rule formats for zero and unit elements, On the computational complexity of bisimulation, redux, Verification of reactive systems via instantiation of parameterised Boolean equation systems, Modal logics for communicating systems, Prespecification in data refinement, Component simulation-based substitutivity managing QoS and composition issues, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, Fuzzy relation equations and reduction of fuzzy automata, An intensional characterization of the largest bisimulation, Automata on infinite objects and their applications to logic and programming, Reduction of fuzzy automata by means of fuzzy quasi-orders, Quantitative simulations by matrices, Approximately bisimilar symbolic models for nonlinear control systems, Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity, Generating priority rewrite systems for OSOS process languages, (Bi)simulations up-to characterise process semantics, A note on an expressiveness hierarchy for multi-exit iteration, Bisimulation and divergence, A note on the notation of recursion in process algebras, Conduché property and tree-based categories, Raiders of the lost equivalence: probabilistic branching bisimilarity, Calculi for synchrony and asynchrony, Axiomatising finite delay operators, Non-deterministic data types: Models and implementations, Equivalence notions and model minimization in Markov decision processes, Combining symmetry reduction and under-approximation for symbolic model checking, A simple fixpoint argument without the restriction to continuity
