A complete inference system for a class of regular behaviours
From MaRDI portal
Publication:1057072
DOI10.1016/0022-0000(84)90023-0zbMath0562.68065OpenAlexW2169869634MaRDI QIDQ1057072
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/15159317/A_Complete_Inference_System_for_a_Class_of_Regular_Behaviours.pdf
Related Items (only showing first 100 items - show all)
Proving the validity of equations in GSOS languages using rule-matching bisimilarity ⋮ Higher-level synchronising devices in Meije-SCCS ⋮ Rule formats for compositional non-interference properties ⋮ A complete axiomatisation for trace congruence of finite state behaviors ⋮ Complete axiomatization for the total variation distance of Markov chains ⋮ Tau laws for pi calculus ⋮ A context dependent equivalence between processes ⋮ A complete equational axiomatization for prefix iteration ⋮ Axiomatizing recursion-free, regular monitors ⋮ Linear time and branching time semantics for recursion with merge ⋮ Step bisimulation is pomset equivalence on a parallel language without explicit internal choice ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizing rational power series over natural numbers ⋮ Two-thirds simulation indexes and modal logic characterization ⋮ An equational axiomatization for multi-exit iteration ⋮ The equational theory of pomsets ⋮ Bisimulation on speed: Worst-case efficiency ⋮ A complete axiomatization of finite-state ACSR processes ⋮ Axiomatizations for the perpetual loop in process algebra ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Verification of finite-state machines: a distributed approach ⋮ A complete axiomatization of weighted branching bisimulation ⋮ The equational logic of fixed points ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with propositional signals ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence ⋮ Revisiting sequential composition in process calculi ⋮ An algebraic theory of multiple clocks ⋮ Infinite results ⋮ Theory of interaction ⋮ An axiomatic semantics for the synchronous language Gentzen. ⋮ Nondeterministic regular expressions as solutions of equational systems. ⋮ A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ A dynamic logic with branching modalities ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Better automata through process algebra ⋮ Expressiveness modulo bisimilarity of regular expressions with parallel composition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CCS expressions, finite state processes, and three problems of equivalence ⋮ Unnamed Item ⋮ Iteration Semirings ⋮ Team equivalences for finite-state machines with silent moves ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Compositional semantics and behavioral equivalences for P systems ⋮ Deciding Bisimilarity of Full BPA Processes Locally ⋮ Topological Construction of Parameterized Bisimulation Limit ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Fairness and regularity for SCCS processes ⋮ A complete axiomatization of timed bisimulation for a class of timed regular behaviours ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ A complete proof system for Nested Term Graphs ⋮ CCS with priority guards ⋮ The expressive power of implicit specifications ⋮ Unnamed Item ⋮ Using Hoare Logic in a Process Algebra Setting ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration ⋮ Tree Process Calculus ⋮ Quantitative Kleene coalgebras ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems ⋮ Non-deterministic structures of computation ⋮ Metrics for weighted transition systems: axiomatization and complexity ⋮ On quasi-open bisimulation ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ Linearization in parallel pCRL ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ A brief history of process algebra ⋮ From regular expressions to deterministic automata ⋮ Non-regular iterators in process algebra ⋮ An axiomatic semantics for Esterel ⋮ Generating priority rewrite systems for OSOS process languages ⋮ A note on an expressiveness hierarchy for multi-exit iteration ⋮ Submodule construction as equation solving in CCS ⋮ A complete axiomatisation for observational congruence of finite-state behaviours ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Group axioms for iteration ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ Unique, guarded fixed points in an additive setting ⋮ Calculi for synchrony and asynchrony ⋮ Axiomatising finite delay operators ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Understanding the mismatch combinator in chi calculus ⋮ Bisimilarity of open terms. ⋮ Efficient and flexible matching of recursive types ⋮ Axiomatising divergence ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ A Generic Process Algebra ⋮ Combinatory reduction systems: Introduction and survey ⋮ An algebra of Boolean processes
Cites Work
This page was built for publication: A complete inference system for a class of regular behaviours
