Pages that link to "Item:Q163528"
From MaRDI portal
The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):
Displaying 50 items.
- Final coalgebras and a solution theorem for arbitrary endofunctors (Q2842550) (← links)
- GSOS for probabilistic transition systems (extended abstract) (Q2842551) (← links)
- Institutionalising many-sorted coalgebraic modal logic (Q2842552) (← links)
- Coalgebraic monads (Q2842553) (← links)
- Some co-Birkhoff type theorems (Q2842554) (← links)
- Comprehension for coalgebras (Q2842555) (← links)
- Definability, canonical models, compactness for finitary coalgebraic modal logic (Q2842556) (← links)
- Modal predicates and coequations (Q2842557) (← links)
- Towards coalgebraic behaviourism (Q2842558) (← links)
- Towards behavioral Maude: behavioral membership equational logic (Q2842559) (← links)
- Abstract logics as dialgebras (Q2842560) (← links)
- A syntactical approach to weak (bi-)simulation for coalgebras (Q2842561) (← links)
- Coinductive counting: bisimulation in enumerative combinatorics (extended abstract) (Q2842562) (← links)
- From parity games to circular proofs (Q2842563) (← links)
- Greatest bisimulations for binary methods (Q2842564) (← links)
- Well-behaved translations between structural operational semantics (Q2842565) (← links)
- A note on coalgebras and presheaves (Q2842566) (← links)
- Contraction of the ITCPN state space (Q2842567) (← links)
- Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency) (Q2842569) (← links)
- Verification of asynchronous circuits using timed automata (Q2842571) (← links)
- On improving backwards verification of timed automata (extended abstract) (Q2842572) (← links)
- TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources (Q2842574) (← links)
- Performance analysis of retrial queueing systems using generalized stochastic Petri nets (Q2842575) (← links)
- Prefix and projection onto state in duration calculus (Q2842576) (← links)
- Exact acceleration of real-time model checking (Q2842578) (← links)
- Formal synthesis of real-time embedded software by time-memory scheduling of colored time Petri nets (Q2842581) (← links)
- Timed semantics of message sequence charts based on timed automata (Q2842583) (← links)
- Modular synthesis of timed circuits using partial orders on LPNs (Q2842584) (← links)
- Parking can get you there faster: model augmentation to speed up real-time model checking (Q2842586) (← links)
- Predicate abstraction for dense real-time systems (Q2842588) (← links)
- Classes of timed automata and the undecidability of universality (Q2842589) (← links)
- Interval duration logic: expressiveness and decidability (Q2842590) (← links)
- Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: a comparative description (Q2842591) (← links)
- Syntactic unification as a geometric operation in free modules over certain rings (Q2842592) (← links)
- A categorical approach to unification of generalised terms (Q2842593) (← links)
- Pattern unification with sequence variables and flexible arity symbols (Q2842594) (← links)
- A multi-adjoint approach to similarity-based unification (Q2842595) (← links)
- Vague domains, S-unification and logic programming (Q2842597) (← links)
- The probability nesting game (Q2842598) (← links)
- On the expressive power of polyadic synchronisation in \(\pi \)-calculus (Q2842599) (← links)
- A logical process calculus (Q2842601) (← links)
- Interaction nets with McCarthy's \(\mathsf{amb}\) (Q2842603) (← links)
- Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition (Q2842604) (← links)
- Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
- Deriving bisimulation congruences: a 2-categorical approach (Q2842606) (← links)
- Modal logics for cryptographic processes (Q2842609) (← links)
- Timed CSP = closed timed automata (Q2842610) (← links)
- Physical traces: quantum vs. classical information processing (Q2842812) (← links)
- On rational monads and free iterative theories (Q2842813) (← links)
- Unique, guarded fixed points in an additive setting: extended abstract (Q2842814) (← links)
