Structured operational semantics and bisimulation as a congruence
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- Algebraic laws for nondeterminism and concurrency
- Bisimulation through probabilistic testing
- Calculi for synchrony and asynchrony
- Formal verification of parallel programs
- Global renaming operators in concrete process algebra
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 3808928 (Why is no real title available?)
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 3926231 (Why is no real title available?)
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4037177 (Why is no real title available?)
- scientific article; zbMATH DE number 4056992 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- Observation equivalence as a testing equivalence
- Readies and Failures in the Algebra of Communicating Processes
- Specification-oriented semantics for communicating processes
- Testing equivalences for processes
- The algebra of communicating processes with empty process
Cited in
(only showing first 100 items - show all)- Semantics and expressiveness of ordered SOS
- Generating priority rewrite systems for OSOS process languages
- A conservative look at operational semantics with variable binding
- A complete equational axiomatization for MPA with string iteration
- GSOS and finite labelled transition systems
- When is partial trace equivalence adequate?
- A complete equational axiomatization for prefix iteration
- A \(\pi\)-calculus with explicit substitutions
- A general conservative extension theorem in process algebras with inequalities
- An alternative formulation of operational conservativity with binding terms.
- Finite axiom systems for testing preorder and De Simone process languages
- Swinging types=functions+relations+transition systems
- Language preorder as a precongruence
- Universal coalgebra: A theory of systems
- Dynamic connectors for concurrency
- Compositional SOS and beyond: A coalgebraic view of open systems
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Observational congruences for dynamically reconfigurable tile systems
- Action transducers and timed automata
- Discrimination by parallel observers: the algorithm.
- Tile formats for located and mobile systems.
- Bisimilarity of open terms.
- Ordered SOS process languages for branching and eager bisimulations
- The meaning of negative premises in transition system specifications. II
- Axiomatizing GSOS with termination
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- A format for semantic equivalence comparison
- Rooted branching bisimulation as a congruence
- Ensuring liveness properties of distributed systems: open problems
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations
- Computing branching distances with quantitative games
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- A linear-time-branching-time spectrum for behavioral specification theories
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Computable processes and bisimulation equivalence
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Operational semantics for Petri net components
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- The quantitative linear-time-branching-time spectrum
- Notions of bisimulation and congruence formats for SOS with data
- A theory of stochastic systems. II: Process algebra
- A general SOS theory for the specification of probabilistic transition systems
- Reversing algebraic process calculi
- Modelling and analysing neural networks using a hybrid process algebra
- Compositional equivalences based on open pNets
- Reactive bisimulation semantics for a process algebra with timeouts
- Structural operational semantics with first-order logic
- Automating soundness proofs
- Modular semantics for transition system specifications with negative premises
- All linear-time congruences for familiar operators
- On well-foundedness and expressiveness of promoted tyft (being promoted makes a difference)
- A congruence rule format with universal quantification
- Characteristic formulae for fixed-point semantics: a general framework
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- Non-strongly stable orders also define interesting simulation relations
- Towards bialgebraic semantics for the linear time -- branching time spectrum
- Probabilistic transition system specification: congruence and full abstraction of bisimulation
- Kleene's three-valued logic and process algebra
- Weak bisimulation as a congruence in MSOS
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- scientific article; zbMATH DE number 7449991 (Why is no real title available?)
- scientific article; zbMATH DE number 7449995 (Why is no real title available?)
- A pre-congruence format for XY-simulation
- Correcting a Space-Efficient Simulation Algorithm
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- scientific article; zbMATH DE number 1314229 (Why is no real title available?)
- Rule formats for determinism and idempotence
- Structured transition systems with parametric observations: observational congruences and minimal realizations
- On deciding some equivalences for concurrent processes
- scientific article; zbMATH DE number 1479627 (Why is no real title available?)
- scientific article; zbMATH DE number 1479628 (Why is no real title available?)
- scientific article; zbMATH DE number 1759487 (Why is no real title available?)
- The fork calculus
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- Modular bisimulation theory for computations and values
- Rewrite systems with constraints
- Rule formats for nominal process calculi
- Failure trace semantics for a process algebra with time-outs
- SOS rule formats for convex and abstract probabilistic bisimulations
- scientific article; zbMATH DE number 7471704 (Why is no real title available?)
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- scientific article; zbMATH DE number 7559474 (Why is no real title available?)
- A \(\pi \)-calculus with explicit substitutions: the late semantics
- Divergence and unique solution of equations
- Lean and full congruence formats for recursion
- Barbed bisimulation
- Divergence and unique solution of equations
- A specification format for rooted branching bisimulation
- Equations, contractions, and unique solutions
- Foundations of Software Science and Computational Structures
- Final semantics for a higher order concurrent language
- Variable binding operators in transition system specifications
- Quantales, finite observations and strong bisimulation
- A coalgebraic presentation of structured transition systems
- From rewrite rules to bisimulation congruences
- Explicit substitutions for -congruences
- An axiomatic semantics for Esterel
- Nested semantics over finite trees are equationally hard
- Lang-n-Send Extended: Sending Regular Expressions to Monitors
This page was built for publication: Structured operational semantics and bisimulation as a congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198952)
