Publication:3907077
From MaRDI portal
zbMath0457.68049MaRDI QIDQ3907077
Publication date: 1981
68Q45: Formal languages and automata
Related Items
Construction of a Deterministicω-Automaton Using Derivatives, Unnamed Item, On deciding some equivalences for concurrent processes, Domain mu-calculus, On Distributive Fixed-Point Expressions, A Finite Axiomatization of Nondeterministic Regular Expressions, 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, 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, An efficient algorithm for computing bisimulation equivalence, Updatable timed automata, DP lower bounds for equivalence-checking and model-checking of one-counter automata, De Bakker-Zucker processes revisited, Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus, Bisimulation for probabilistic transition systems: A coalgebraic approach, Models of nondeterministic regular expressions, Rooted branching bisimulation as a congruence, Deciding bisimilarity and similarity for probabilistic processes., Computable processes and bisimulation equivalence, Equality of agent expressions is preserved under an extension of the universe of actions, Comparative branching-time semantics for Markov chains, Notions of bisimulation and congruence formats for SOS with data, A tutorial on coinductive stream calculus and signal flow graphs, Characteristic Formulae for Timed Automata, Bisimulation on speed: Worst-case efficiency, Nested semantics over finite trees are equationally hard, Literal shuffle on \(\omega\)-languages, Modelling causality via action dependencies in branching time semantics, Location equivalence in a parametric setting, 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, 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 the computational complexity of bisimulation, redux, 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, Bisimulation through probabilistic testing, Factorisation of finite state machines under strong and observational equivalences, 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, A short proof of the decidability of bisimulation for normed BPA- processes, Structured operational semantics and bisimulation as a congruence, Unique decomposition of processes, TIC: a tImed calculus, 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, A behavioural theory of first-order CML, Theorem proving in a mathematical information environment, Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\), 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, 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, An equational axiomatization for multi-exit iteration, A complete axiomatization of finite-state ACSR processes, Quiescence, fairness, testing, and the notion of implementation, Complexity of equivalence problems for concurrent systems of finite agents, 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., Observational ultraproducts of polynomial coalgebras., Mathematical modal logic: A view of its evolution, Domain theory for concurrency, 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, 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, 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, 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, An infinite hierarchy of temporal logics over branching time, Program algebra with unit instruction operators, Iterating transducers, The max-plus algebra of the natural numbers has no finite equational basis, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Branching time and orthogonal bisimulation equivalence
